Polynomial codes
From MaRDI portal
Recommendations
Cited in
(28)- A description of some extended cyclic codes with application to Reed- Solomon codes
- Algebraic theory of block codes detecting independent errors
- Polynomials generating Hamming codes
- Combinatorial \(S_ n\)-modules as codes
- A new class of majority-logic decodable codes derived from polarity designs
- On the number of q-ary quasi-perfect codes with covering radius 2
- Quasi-cyclic codes from a finite affine plane
- A survey of constructive coding theory, and a table of binary codes of highest known rate
- Codes from symmetric polynomials
- Boolean functions for homomorphic-friendly stream ciphers
- Polyadic Codes Revisited
- Code Generation for Polynomial Multiplication
- scientific article; zbMATH DE number 3965972 (Why is no real title available?)
- scientific article; zbMATH DE number 3485622 (Why is no real title available?)
- scientific article; zbMATH DE number 1284429 (Why is no real title available?)
- Binary coding by integration of polynomials
- Extensions of the method of poles for code construction
- On a class of majority-logic decodable cyclic codes
- Redundant residue polynomial codes
- Polynomial weights and code constructions
- The degree of functions and weights in linear codes.
- On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata
- Some self-dual codes and isodual codes constructed by matrix product codes
- On nonlinear 1-quasi-perfect codes and their structural properties
- Hull parameters of projective Reed-Muller codes
- The automorphism group of Generalized Reed-Muller codes
- Hulls of projective Reed-Muller codes
- Derivative descendants of cyclic codes and constacyclic codes
This page was built for publication: Polynomial codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5617449)