On the minimum distances of non-binary cyclic codes
From MaRDI portal
Publication:1963168
DOI10.1023/A:1008354504832zbMATH Open0941.94020OpenAlexW1523747139MaRDI QIDQ1963168FDOQ1963168
Authors: Pascale Charpin, Aimo Tietäväinen, Victor A. Zinoviev 
Publication date: 24 January 2000
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008354504832
Recommendations
Cited In (19)
- Decoding Cyclic Codes up to a New Bound on the Minimum Distance
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the minimum distance of negacyclic codes with two zeros
- A non-cyclic triple-error-correcting BCH-like code and some minimum distance results
- Title not available (Why is that?)
- Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)
- Irreducible trinomials over finite fields
- Cyclic codes from some monomials and trinomials
- On a sequence of cyclic codes with minimum distance six
- Title not available (Why is that?)
- On a (145, 32) binary cyclic code
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
- A new class of distance-optimal binary cyclic codes and their duals
- On bases of BCH codes with designed distance 3 and their extensions
- More on the minimum distance of cyclic codes
- Counting irreducible polynomials over GF(3) with first and third coefficients given
- Optimal \(p\)-ary cyclic codes with two zeros
- On the Minimal Distance of Binary Self-Dual Cyclic Codes
This page was built for publication: On the minimum distances of non-binary cyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963168)
