On (partial) unit memory codes based on Gabidulin codes
The authors consider unit memory and partial unit memory convolutional codes. These rank-\(k/n\) codes have memory 1 and overall constraint length \(\nu=k\) (unit memory codes) or \(\nu<k\) (partial unit memory codes). Thus a (partial) unit memory code has a \(k \times n\) generator matrix of polynomials of degree at most 1. Since the memory is 1, the generator matrix may be given in the form \(G_0+G_1\cdot D\) where \(G_0\), \(G_1\) are scalar matrices of size \(k \times n\). Upper bounds on the free rank distance and slope of unit memory and partial unit memory codes are given. The authors also give a construction for unit memory and partial unit memory codes based on Gabidulin codes, which are certain block codes defined in terms of a parity check matrix. This construction meets the free rank distance upper bound and reaches half of the slope upper bound.
- scientific article; zbMATH DE number 1714666
- On periodic (partial) unit memory codes with maximum free distance
- Construction of partial unit-memory convolutional codes based on Reed-Muller codes
- A novel construction of high-rate unit-memory code
- A new construction of partial unit memory codes based on Reed-Solomon codes
- A Rank-Metric Approach to Error Control in Random Network Coding
- Bilinear forms over a finite field, with applications to coding theory
- Bounded distance decoding of unit memory codes
- Bounded minimum distance decoding of unit memory codes
- Bounds on distances and error exponents of unit memory codes
- Coding for Errors and Erasures in Random Network Coding
- Convolutional codes I: Algebraic structure
- Finite-state codes
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 1314690 (Why is no real title available?)
- Maximum-rank array codes and their application to crisscross error correction
- On periodic (partial) unit memory codes with maximum free distance
- Optical pulse timing resolution (Corresp.)
- Some optimal partial-unit-memory codes (Corresp.)
- Theory of codes with maximum rank distance
- A new construction of partial unit memory codes based on Reed-Solomon codes
- A novel construction of high-rate unit-memory code
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
- Bounded minimal distance decoding of (P)UM codes based on RS codes
- Theory of supports for linear codes endowed with the sum-rank metric
- scientific article; zbMATH DE number 1714666 (Why is no real title available?)
- On optimal extended row distance profile
- Some constructions of generalised concatenated codes based on unit memory codes
- Partial unit memory codes on the base of subcodes of Hadamard codes
- Rank-metric codes and their applications
- Codes in the sum-rank metric: fundamentals and applications
- Fast decoding of interleaved linearized Reed-Solomon codes and variants
This page was built for publication: On (partial) unit memory codes based on Gabidulin codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764387)
