On trellis structures for Reed-Muller codes
From MaRDI portal
Recommendations
- On bit-level trellis complexity of Reed-Muller codes
- On the trellis structure of block codes
- On algebraic structure of the Reed-Muller codes
- On the Reed-Muller codes
- On the weight structure of Reed-Muller codes
- scientific article; zbMATH DE number 1498785
- On generalized ReedMuller codes and their relatives
- On a conjecture on Reed-Muller codes
- Quasi-cyclic structure of Reed-Muller codes and their smallest regular trellis diagram
- The trellis structure of maximal fixed-cost codes
Cites work
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 1222363 (Why is no real title available?)
- Bounds on the trellis size of linear block codes
- Coset codes. II. Binary lattices and related codes
- Dimension/length profiles and trellis complexity of linear block codes
- Efficient maximum likelihood decoding of linear block codes using a trellis
- Minimal trellises for block codes
- On bit-level trellis complexity of Reed-Muller codes
- On complexity of trellis structure of linear block codes
- On the BCJR trellis for linear block codes
- On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
- On the trellis structure of block codes
- Trellis decoding complexity of linear block codes
Cited in
(13)- A systematic approach to the construction of bandwidth-efficient multidimensional trellis codes
- The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes
- Very low rate trellis/Reed-Muller (TRM) codes
- Trellis codes for periodic erasures
- scientific article; zbMATH DE number 969093 (Why is no real title available?)
- Matrix theory for minimal trellises
- On the trellis representation of the Delsarte-Goethals codes
- scientific article; zbMATH DE number 1284437 (Why is no real title available?)
- Orphan structure of the first-order Reed--Muller codes
- On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
- Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes
- Trellis structure and higher weights of extremal self-dual codes
- Structure, optimization, and realization of FFSK trellis codes
This page was built for publication: On trellis structures for Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971064)
