Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codes

DOI10.1109/TIT.1969.1054262MaRDI QIDQ5554045zbMATH OpenFDO

Authors David Knee, Herbert D. Goldman

Publication date 1969

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1969.1054262

zbMATH Keywords

large minimum distance BCH codesquasi-self-reciprocal polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Linear codes (general theory) (94B05)

Recommendations

• The minimum distance of some narrow-sense primitive BCH codes
• A characterization of primitive polynomials over finite fields.
• scientific article; zbMATH DE number 975392
• BCH codes with minimum distance proportional to code length
• Dimension and minimum distance of a class of \(BCH\) codes

Cited in

(5)

• Algebraic theory of block codes detecting independent errors
• Good integers and some applications in coding theory
• The average dimension of the hull of cyclic codes.
• -reciprocal polynomials
• SRIM and SCRIM factors of \(x^n+1\) over finite fields and their applications

This page was built for publication: Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5554045)