Encoding through generalized polynomial codes

DOI10.1590/S1807-03022011000200006zbMath1230.94010OpenAlexW2012698420MaRDI QIDQ656544

Juan-Miguel Gracia

Publication date: 18 January 2012

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.scielo.br/scielo.php?script=sci_abstract&pid=S1807-03022011000200006&lng=en&nrm=iso&tlng=en

zbMATH Keywords

cyclic codesemigroup ringBCH codeGoppa codeSrivastava codealternant code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Cyclic codes (94B15)

Related Items (7)

A method for improving the code rate and error correction capability of a cyclic code ⋮ Maximal cyclic subgroups of the groups of units of Galois rings: a computational approach ⋮ On codes over quaternion integers ⋮ Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission ⋮ Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0\) and encoding] ⋮ CYCLIC CODES THROUGH $B[X;\frac{a}{b}{\mathbb Z}_{0}$, WITH $\frac{a}{b}\in {\mathbb Q}^{+}$ AND b = a+1, AND ENCODING] ⋮ A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code

This page was built for publication: Encoding through generalized polynomial codes