Construction of partial unit-memory convolutional codes based on Reed-Muller codes
From MaRDI portal
On the basis of Reed-Muller codes a construction of partial unit-memory convolutional encoders is given. The characteristic properties of this construction and several decoding methods for the codes generated by those encoders, including maximum-likelihood and threshold decoding, are investigated. Finally, some examples of partial unit-memory convolutional codes are compared with respect to their decoding complexity and performance.
Recommendations
- A new construction of partial unit memory codes based on Reed-Solomon codes
- Construction of Partial-Unit-Memory MDS Convolutional Codes
- Generalized unit-memory convolutional concatenated codes
- Some constructions of generalised concatenated codes based on unit memory codes
- Partial unit memory codes on the base of subcodes of Hadamard codes
- Two-step trellis decoding of partial unit memory convolutional codes
- scientific article; zbMATH DE number 1714666
- Quasi-cyclic unit memory convolutional codes
- Using combinatorial optimization to design good unit-memory convolutional codes
Cited in
(5)- A new construction of partial unit memory codes based on Reed-Solomon codes
- scientific article; zbMATH DE number 1714666 (Why is no real title available?)
- Construction of Partial-Unit-Memory MDS Convolutional Codes
- Some constructions of generalised concatenated codes based on unit memory codes
- On (partial) unit memory codes based on Gabidulin codes
This page was built for publication: Construction of partial unit-memory convolutional codes based on Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179605)
