The minimum distance of the duals of binary irreducible cyclic codes

DOI10.1109/TIT.2002.802593zbMath1062.94053OpenAlexW2170592600MaRDI QIDQ4677589

Harald Niederreiter, Cunsheng Ding, Tor Helleseth, Xing, Chaoping

Publication date: 11 May 2005

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

Full work available at URL: https://doi.org/10.1109/tit.2002.802593

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Related Items (4)

On classical Kloosterman sums ⋮ Construction of cyclic codes over \(\mathbb F_2 + u\mathbb F_2\) for DNA computing ⋮ The weight distribution of some irreducible cyclic codes ⋮ A note on the weight distribution of some cyclic codes

This page was built for publication: The minimum distance of the duals of binary irreducible cyclic codes