Polynomial codes
From MaRDI portal
Publication:5617449
DOI10.1109/TIT.1968.1054226zbMath0214.47104MaRDI QIDQ5617449
W. Wesley Peterson, Shu Lin, Tadao Kasami
Publication date: 1968
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
BCH codesReed-Solomon codesfinite geometry codesgeneralized primitive Reed-Muller codesmajority-logic decodable
Related Items (9)
Combinatorial \(S_ n\)-modules as codes ⋮ On the number of \(q\)-ary quasi-perfect codes with covering radius 2 ⋮ Algebraic theory of block codes detecting independent errors ⋮ On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata ⋮ Boolean Functions for Homomorphic-Friendly Stream Ciphers ⋮ The automorphism group of Generalized Reed-Muller codes ⋮ The degree of functions and weights in linear codes. ⋮ Quasi-cyclic codes from a finite affine plane ⋮ A survey of constructive coding theory, and a table of binary codes of highest known rate
This page was built for publication: Polynomial codes
