On (partial) unit memory codes based on Gabidulin codes
From MaRDI portal
Publication:764387
DOI10.1134/S0032946011020049zbMath1248.94117OpenAlexW2148957188MaRDI QIDQ764387
Publication date: 13 March 2012
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946011020049
Related Items (4)
Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring ⋮ Theory of supports for linear codes endowed with the sum-rank metric ⋮ Rank-Metric Codes and Their Applications ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications
Cites Work
- Unnamed Item
- Unnamed Item
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Bounds on distances and error exponents of unit memory codes
- Finite-state codes
- Optical pulse timing resolution (Corresp.)
- Some optimal partial-unit-memory codes (Corresp.)
- Bounded distance decoding of unit memory codes
- On periodic (partial) unit memory codes with maximum free distance
- Bounded minimum distance decoding of unit memory codes
- Convolutional codes I: Algebraic structure
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: On (partial) unit memory codes based on Gabidulin codes