Unit memory convolutional codes with maximum distance
Unit memory codes and, in particular, partial unit memory codes are reviewed. Conditions for the optimality of partial unit memory codes with degree \(k-1\) are given, where optimal codes are the codes having the maximum free distance among all codes of the same rate \(R=k/n\) and degree \(\mu\). A binary construction of unit memory codes with \(\mu=k-1\) is discussed for the cases that satisfy the optimality conditions. This construction is generalized for codes over fields of characteristic \(p>2\). For the entire collection see [Zbl 0960.00082].
- On periodic (partial) unit memory codes with maximum free distance
- On (partial) unit memory codes based on Gabidulin codes
- A novel construction of high-rate unit-memory code
- Construction of partial unit-memory convolutional codes based on Reed-Muller codes
- On unit constraint-length convolutional codes
- Construction of partial unit-memory convolutional codes based on Reed-Muller codes
- Bounds on distances for unit memory concatenated codes.
- A novel construction of high-rate unit-memory code
- Coding theory: the unit-derived methodology
- Convolutional codes with maximum distance profile
- Unit-memory codes for continuous phase modulation in an AWGN channel
- Quasi-cyclic unit memory convolutional codes
- On unit constraint-length convolutional codes
- Using combinatorial optimization to design good unit-memory convolutional codes
- On optimal extended row distance profile
- Partial unit memory codes on the base of subcodes of Hadamard codes
- On periodic (partial) unit memory codes with maximum free distance
- A directed search approach for unit-memory convolutional codes
- On (partial) unit memory codes based on Gabidulin codes
This page was built for publication: Unit memory convolutional codes with maximum distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776537)
