CYCLIC CODES THROUGH $B[X;\frac{a}{b}{\mathbb Z}_{0}]$, WITH $\frac{a}{b}\in {\mathbb Q}^{+}$ AND b = a+1, AND ENCODING

DOI10.1142/S1793830912500590zbMath1262.94025MaRDI QIDQ4903645

Tariq Shah, Antonio Aparecido de Andrade

Publication date: 24 January 2013

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

cyclic codeBCH codemonoid ringGoppa codeSrivastava codealternant code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Related Items (1)

Maximal cyclic subgroups of the groups of units of Galois rings: a computational approach

Cites Work

• Unnamed Item
• Unnamed Item
• Encoding through generalized polynomial codes
• An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
• Generators and weights of polynomial codes
• Divisibility properties in semigroup rings
• Algorithms for computing parameters of graph-based extensions of BCH codes
• Linear Codes over Finite Rings
• Srivastava codes

This page was built for publication: CYCLIC CODES THROUGH $B[X;\frac{a}{b}{\mathbb Z}_{0}]$, WITH $\frac{a}{b}\in {\mathbb Q}^{+}$ AND b = a+1, AND ENCODING