Algebraic decoding of the Zetterberg codes
From MaRDI portal
Publication:4014182
DOI10.1109/18.149509zbMATH Open0756.94014OpenAlexW2099556577MaRDI QIDQ4014182FDOQ4014182
Authors: J. E. M. Nilsson, Stefan Dodunekov
Publication date: 12 October 1992
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.149509
Recommendations
space complexitytime complexityZetterberg codesalgebraic decoding algorithmdouble-error correcting binary linear codes
Cited In (16)
- On the lifted Zetterberg code
- Several classes of Niho type Boolean functions with few Walsh transform values
- A class of new permutation trinomials
- Title not available (Why is that?)
- Quadratic-residue codes and cyclotomic fields
- Two classes of permutation trinomials with Niho exponents
- On Decoding Algebraic Codes Using Radical Locators
- On a Class of Reversible Binary Cyclic Codes and their Algebraic Decoding
- A Unified View on Known Algebraic Decoding Algorithms and New Decoding Concepts
- Efficient decoding of Z/sub p/k-linear codes
- Title not available (Why is that?)
- A class of permutation quadrinomials
- A class of permutation trinomials over finite fields of odd characteristic
- A revisit to a class of permutation quadrinomials
- Several classes of complete permutation polynomials with Niho exponents
- Algebraic decoding of class of multilevel pseudocyclic codes
This page was built for publication: Algebraic decoding of the Zetterberg codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4014182)