Cyclic codes through B[X], B[X;1kp Z₀] and B[X;1p^k Z₀]: a comparison

DOI10.1142/S0219498812500788zbMATH Open1255.94085OpenAlexW1860025141MaRDI QIDQ2909809FDOQ2909809

Tariq Shah, Antonio Aparecido de Andrade

Publication date: 6 September 2012

Published in: Journal of Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219498812500788

Recommendations

• Cyclic codes through \(B[X; \frac {a}{b}\mathbb Z_0]\), with \(\frac {a}{b}\in \mathbb Q^+\) and \(b=a+1\), and encoding
• Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding
• Encoding through generalized polynomial codes
• Cyclic codes through a semigroup ring
• Codes over certain rings

zbMATH Keywords

cyclic codesemigroup ringBCH codeGoppa codeSrivastava codealternant code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modular and \(p\)-adic cyclic codes
• Codes over integer residue rings
• Codes over certain rings
• Generators and weights of polynomial codes
• Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding
• An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
• Algorithms for computing parameters of graph-based extensions of BCH codes
• Srivastava codes

Cited In (3)

• Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission
• Title not available (Why is that?)
• Maximal cyclic subgroups of the groups of units of Galois rings: a computational approach

This page was built for publication: Cyclic codes through \(B[X]\), \(B[X;\frac{1}{kp} \mathbb Z_0]\) and \(B[X;\frac{1}{p^k}\mathbb Z_0]\): a comparison

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909809)