Estimating the sizes of binary error-correcting constrained codes
VA Rameshwar, N Kashyap - IEEE Journal on Selected Areas …, 2023 - ieeexplore.ieee.org
In this paper, we study binary constrained codes that are resilient to bit-flip errors and
erasures. In our first approach, we compute the sizes of constrained subcodes of linear …
erasures. In our first approach, we compute the sizes of constrained subcodes of linear …
Sampling-based estimates of the sizes of constrained subcodes of Reed-Muller codes
VA Rameshwar, S Jain… - 2024 National Conference …, 2024 - ieeexplore.ieee.org
This paper develops an algorithmic approach for obtaining approximate, numerical
estimates of the sizes of subcodes of Reed-Muller (RM) codes, all of the codewords in which …
estimates of the sizes of subcodes of Reed-Muller (RM) codes, all of the codewords in which …
Estimating the Weight Enumerators of Reed-Muller Codes via Sampling
This paper develops an algorithmic approach for obtaining estimates of the weight
enumerators of Reed-Muller (RM) codes. Our algorithm is based on a technique for …
enumerators of Reed-Muller (RM) codes. Our algorithm is based on a technique for …
Counting Constrained Codewords in Binary Linear Codes via Fourier Expansions
VA Rameshwar, N Kashyap - 2023 IEEE International …, 2023 - ieeexplore.ieee.org
In this paper, we consider the problem of computing the sizes of subcodes of binary linear
codes, all of whose codewords need to satisfy an additional property, which we call a …
codes, all of whose codewords need to satisfy an additional property, which we call a …