On the decoding of Reed-Solomon and BCH codes over integer residue rings
From MaRDI portal
Publication:4361468
DOI10.1109/18.568713zbMath0926.94035OpenAlexW2103585214MaRDI QIDQ4361468
J. Carmelo Interlando, Michele Elia, Reginaldo jun. Palazzo
Publication date: 5 January 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.568713
Related Items (14)
Computing the reciprocal of units in Galois rings ⋮ Construction and decoding of BCH codes over chain of commutative rings ⋮ Identification of proteins by the use of Chinese remainder theorem codes over finite commutative rings ⋮ List decoding of convolutional codes over integer residue rings ⋮ Transmission of intra-cellular genetic information: a system proposal ⋮ Generator polynomials of characteristic ideal of maximal periodic arrays over Galois rings. ⋮ Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission ⋮ A matrix based list decoding algorithm for linear codes over integer residue rings ⋮ Algorithms for computing parameters of graph-based extensions of BCH codes ⋮ Decoding of cyclic codes over the ring \(F_2+uF_2+u^2F_2\) ⋮ An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings ⋮ Gröbner bases over Galois rings with an application to decoding alternant codes ⋮ Maximal Periodic Two-Dimensional Arrays Over Galois Rings ⋮ Construction and decoding of BCH codes over finite commutative rings
This page was built for publication: On the decoding of Reed-Solomon and BCH codes over integer residue rings
