Multilevel Pseudocyclic Codes

DOI10.1080/02522667.1990.10699007zbMATH Open0701.94012OpenAlexW2065033245MaRDI QIDQ3479969FDOQ3479969

Authors: V. C. jun. da Rocha, Ricardo M. Campello de Souza, P. G. Farrell 

Publication date: 1990

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1990.10699007

Recommendations

• Maximum distance separable multilevel codes (Corresp.)
• Algebraic decoding of class of multilevel pseudocyclic codes
• Pseudocyclic maximum-distance-separable codes
• Algebraically punctured cyclic codes
• Construction of noise-resistant codes by means of linear recurrences over Galois rings

zbMATH Keywords

minimum distanceprime numbernegacyclic codesseparable codesBCH type lower boundconstacyclic random error-correcting codes of lengthMultilevel pseudocylic codespolynomials over Galois fields

Mathematics Subject Classification ID

Separable extensions, Galois theory (12F10) Cyclic codes (94B15) Bounds on codes (94B65) Polynomials in general fields (irreducibility, etc.) (12E05)

Cites Work

• Title not available (Why is that?)

Cited In (6)

• Finding cyclic redundancy check polynomials for multilevel systems
• Multilevel codes based on partitioning
• Binary multilevel coset codes based on Reed-Muller codes
• Maximum distance separable multilevel codes (Corresp.)
• Title not available (Why is that?)
• Algebraic decoding of class of multilevel pseudocyclic codes

This page was built for publication: Multilevel Pseudocyclic Codes

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