On (partial) unit memory codes based on Gabidulin codes
From MaRDI portal
Publication:764387
DOI10.1134/S0032946011020049zbMATH Open1248.94117OpenAlexW2148957188MaRDI QIDQ764387FDOQ764387
Authors: D. Kharzeev 
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
Recommendations
- 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
Cites Work
- Bilinear forms over a finite field, with applications to coding theory
- Optical pulse timing resolution (Corresp.)
- Title not available (Why is that?)
- Convolutional codes I: Algebraic structure
- Title not available (Why is that?)
- Theory of codes with maximum rank distance
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Maximum-rank array codes and their application to crisscross error correction
- Some optimal partial-unit-memory codes (Corresp.)
- Bounds on distances and error exponents of unit memory codes
- Finite-state codes
- 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
Cited In (10)
- Theory of supports for linear codes endowed with the sum-rank metric
- On optimal extended row distance profile
- Some constructions of generalised concatenated codes based on unit memory codes
- A novel construction of high-rate unit-memory code
- Partial unit memory codes on the base of subcodes of Hadamard codes
- Title not available (Why is that?)
- A new construction of partial unit memory codes based on Reed-Solomon codes
- Codes in the sum-rank metric: fundamentals and applications
- Rank-metric codes and their applications
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
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)
