scientific article; zbMATH DE number 1498785

MaRDI QIDQ4500975zbMATH OpenFDO

Authors T. Blackmore, G. H. Norton

Publication date 3 September 2000

zbMATH Keywords

generalized Reed-Muller codesGRM-codesminimal span generator matricesstate complexity of a codetrellis of a code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combined modulation schemes (including trellis codes) in coding theory (94B12) Other types of codes (94B60)

Review text

Generalized Reed-Muller codes (GRM-codes) and local behavior of their trellises are considered. The state complexity of a code is determined as the state complexity of its minimal trellis. Trellis complexity, as well as state complexity, gives measures of decoding complexity. A minimal span generator matrix for a GRM-code is a generator matrix that gives the minimal trellis. Generic minimal span generator matrices for the family of GRM-codes are presented and studied. For the entire collection see [Zbl 0918.00043].

Recommendations

• On trellis structures for Reed-Muller codes
• On bit-level trellis complexity of Reed-Muller codes
• Trellis complexity of linear block codes via atomic codewords.

Cited in

(5)

• The minimal generator matrix of a vector space
• On trellis structures for Reed-Muller codes
• scientific article; zbMATH DE number 1222363 (Why is no real title available?)
• scientific article; zbMATH DE number 1284437 (Why is no real title available?)
• On bit-level trellis complexity of Reed-Muller codes

This page was built for publication:

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