Some binary BCH codes with length \(n = 2^m + 1\)

DOI10.1016/j.ffa.2018.09.005zbMath1404.94147arXiv1803.02731OpenAlexW3105341748WikidataQ62573644 ScholiaQ62573644MaRDI QIDQ1633286

Y. Aharonov

Publication date: 19 December 2018

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.02731

zbMATH Keywords

cyclic codeLCD codeBCH codecyclotomic coset

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cyclic codes (94B15)

Related Items (9)

Some binary BCH codes with length \(n = 2^m + 1\) ⋮ A class of almost MDS codes ⋮ Four infinite families of ternary cyclic codes with a square-root-like lower bound ⋮ Two families of negacyclic BCH codes ⋮ Parameters of hulls of primitive binary narrow-sense BCH codes and their subcodes ⋮ BCH cyclic codes ⋮ Optimal quaternary Hermitian LCD codes and their related codes ⋮ BCH Codes with Minimum Distance Proportional to Code Length ⋮ On some cyclic codes of length \(\frac{q^{2m} - 1}{q + 1} \)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complementary dual codes for counter-measures to side-channel attacks
• Some binary BCH codes with length \(n = 2^m + 1\)
• The dimension and minimum distance of two classes of primitive BCH codes
• Dimensions of three types of BCH codes over \(\mathrm{GF}(q)\)
• Parameters of Several Classes of BCH Codes
• The Bose and Minimum Distance of a Class of BCH Codes
• On a class of error correcting binary group codes
• Further results on error correcting binary group codes
• On Quantum and Classical BCH Codes
• On the number of information symbols in Bose-Chaudhuri codes
• Fundamentals of Error-Correcting Codes
• Two Families of LCD BCH Codes
• LCD Cyclic Codes Over Finite Fields

This page was built for publication: Some binary BCH codes with length \(n = 2^m + 1\)