BiD Codes: Algebraic Codes from $3 \times 3$ Kernel
By: Anirudh Dash , K. R. Nandakishore , Lakshmi Prasad Natarajan and more
Potential Business Impact:
Makes messages more reliable for sending data.
We introduce Berman-intersection-dual Berman (BiD) codes. These are abelian codes of length $3^m$ that can be constructed using Kronecker products of a $3 \times 3$ kernel matrix. BiD codes offer minimum distance close to that of Reed-Muller (RM) codes at practical blocklengths, and larger distance than RM codes asymptotically in the blocklength. Simulations of BiD codes of length $3^5=243$ in the erasure and Gaussian channels show that their block error rates under maximum-likelihood decoding are similar to, and sometimes better, than RM, RM-Polar, and CRC-aided Polar codes.
Similar Papers
Binary cyclic codes from permutation polynomials over $\mathbb{F}_{2^m}$
Information Theory
Makes computer signals stronger and safer from errors.
A Short Proof of Coding Theorems for Reed-Muller Codes Under a Mild Assumption
Information Theory
Makes data storage and sending more reliable.
The dimension and Bose distance of certain primitive BCH codes
Information Theory
Fixes errors in digital information better.