A Class of Error-Correcting Codes in $p^m $ Symbols
From MaRDI portal
Publication:5535509
DOI10.1137/0109020zbMath0154.44103OpenAlexW1982892983MaRDI QIDQ5535509
Daniel Gorenstein, Neal Zierler
Publication date: 1961
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0109020
Related Items
New developments in \(q\)-polynomial codes, A New Algorithm for Decoding Reed-Solomon Codes, Quantum BCH codes with maximum designed distance, Dimensions of three types of BCH codes over \(\mathrm{GF}(q)\), Simple algorithms for decoding systematic Reed-Solomon codes, A Decoding Approach to Reed–Solomon Codes from Their Definition, Algebraic theory of block codes detecting independent errors, Dimensions of nonbinary antiprimitive BCH codes and some conjectures, Two families of negacyclic BCH codes, Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance, BCH cyclic codes, BCH Codes with Minimum Distance Proportional to Code Length, At the dawn of the theory of codes, On some cyclic codes of length \(\frac{q^{2m} - 1}{q + 1} \), MemHyb: predicting membrane protein types by hybridizing SAAC and PSSM, Bounded distance decoding of linear error-correcting codes with Gröbner bases, Peterson–Gorenstein–Zierler algorithm for skew RS codes, A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \), Simplified High-Speed High-Distance List Decoding for Alternant Codes, A note on good permutation codes from Reed-Solomon codes, Computer algebra tales on Goppa codes and McEliece cryptography
