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
codes. Since there exist well-known linear codes that achieve vanishing probabilities of
error over the binary symmetric channel (which causes bit-flip errors) and the binary erasure
channel, constrained subcodes of such linear codes are also resilient to random bit-flip
errors and erasures. We employ a simple identity from the Fourier analysis of Boolean …
erasures. In our first approach, we compute the sizes of constrained subcodes of linear
codes. Since there exist well-known linear codes that achieve vanishing probabilities of
error over the binary symmetric channel (which causes bit-flip errors) and the binary erasure
channel, constrained subcodes of such linear codes are also resilient to random bit-flip
errors and erasures. We employ a simple identity from the Fourier analysis of Boolean …
Estimating the Sizes of Binary Error-Correcting Constrained Codes
V Arvind Rameshwar, N Kashyap - arXiv e-prints, 2023 - ui.adsabs.harvard.edu
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
codes. Since there exist well-known linear codes that achieve vanishing probabilities of
error over the binary symmetric channel (which causes bit-flip errors) and the binary erasure
channel, constrained subcodes of such linear codes are also resilient to random bit-flip
errors and erasures. We employ a simple identity from the Fourier analysis of Boolean …
erasures. In our first approach, we compute the sizes of constrained subcodes of linear
codes. Since there exist well-known linear codes that achieve vanishing probabilities of
error over the binary symmetric channel (which causes bit-flip errors) and the binary erasure
channel, constrained subcodes of such linear codes are also resilient to random bit-flip
errors and erasures. We employ a simple identity from the Fourier analysis of Boolean …
以上显示的是最相近的搜索结果。 查看全部搜索结果