Algebraic decoding of the Zetterberg codes
From MaRDI portal
Publication:4014182
DOI10.1109/18.149509zbMath0756.94014OpenAlexW2099556577MaRDI QIDQ4014182
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
time complexityspace complexityZetterberg codesalgebraic decoding algorithmdouble-error correcting binary linear codes
Related Items (10)
On the lifted Zetterberg code ⋮ Quadratic-residue codes and cyclotomic fields ⋮ On a Class of Reversible Binary Cyclic Codes and their Algebraic Decoding ⋮ Several classes of complete permutation polynomials with Niho exponents ⋮ Several classes of Niho type Boolean functions with few Walsh transform values ⋮ A class of new permutation trinomials ⋮ Two classes of permutation trinomials with Niho exponents ⋮ A class of permutation quadrinomials ⋮ A class of permutation trinomials over finite fields of odd characteristic ⋮ A revisit to a class of permutation quadrinomials
This page was built for publication: Algebraic decoding of the Zetterberg codes