The minimum distance of the duals of binary irreducible cyclic codes
From MaRDI portal
Publication:4677589
DOI10.1109/TIT.2002.802593zbMATH Open1062.94053OpenAlexW2170592600MaRDI QIDQ4677589FDOQ4677589
Authors: Cunsheng Ding, Tor Helleseth, Harald Niederreiter, Chaoping Xing
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
Recommendations
- The weight distribution of some irreducible cyclic codes
- scientific article; zbMATH DE number 2094822
- Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)
- A note on weight distributions of irreducible cyclic codes
- The weight distribution for any irreducible cyclic code of length \(p^m\)
Cited In (10)
- The weight distribution of some irreducible cyclic codes
- Error detection of irreducible cyclic codes on \(q\)-ary symmetric channel
- Error Detection With a Class of Irreducible Binary Cyclic Codes and Their Dual Codes
- A note on the weight distribution of some cyclic codes
- Title not available (Why is that?)
- Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)
- On classical Kloosterman sums
- A new class of distance-optimal binary cyclic codes and their duals
- Construction of cyclic codes over \(\mathbb F_2 + u\mathbb F_2\) for DNA computing
- On the Minimal Distance of Binary Self-Dual Cyclic Codes
This page was built for publication: The minimum distance of the duals of binary irreducible cyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4677589)