The following pages link to Polynomial codes (Q5617449):
Displaying 18 items.
- The automorphism group of Generalized Reed-Muller codes (Q686144) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- Polynomials generating Hamming codes (Q1336018) (← links)
- Combinatorial \(S_ n\)-modules as codes (Q1344190) (← links)
- On the number of \(q\)-ary quasi-perfect codes with covering radius 2 (Q2161415) (← links)
- Quasi-cyclic codes from a finite affine plane (Q2491281) (← links)
- A survey of constructive coding theory, and a table of binary codes of highest known rate (Q2555036) (← links)
- Codes from symmetric polynomials (Q2692950) (← links)
- Boolean Functions for Homomorphic-Friendly Stream Ciphers (Q3294876) (← links)
- Polyadic Codes Revisited (Q3547281) (← links)
- Code Generation for Polynomial Multiplication (Q3644088) (← links)
- (Q4242023) (← links)
- Extensions of the method of poles for code construction (Q4680113) (← links)
- Redundant residue polynomial codes (Q5550270) (← links)
- The degree of functions and weights in linear codes. (Q5939238) (← links)
- On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata (Q6394816) (← links)
- Some self-dual codes and isodual codes constructed by matrix product codes (Q6632049) (← links)
- On nonlinear 1-quasi-perfect codes and their structural properties (Q6660008) (← links)
