2025/07/14 by Dash, Anirudh, K. R. Nandakishore, Nandakishore, K. R. +4
Computer Science · #Advanced Data Storage Technologies #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.2507.10068
openalex publication_date 2025/07/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce Berman-intersection-dual Berman (BiD) codes. These are abelian codes of length 3m that can be constructed using Kronecker products of a 3 × 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 35=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.