Binary polycyclic codes from powers of irreducible polynomials have determined Hamming distances and LCD properties, with exact results and optimal code constructions for specific self-reciprocal trinomials.
Minimum distance bounds for cyclic codes and Deligne’s theorem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
On the Hamming Distance and LCD Properties of Binary Polycyclic Codes and Their Duals
Binary polycyclic codes from powers of irreducible polynomials have determined Hamming distances and LCD properties, with exact results and optimal code constructions for specific self-reciprocal trinomials.