Algebraic codes for network coding
From MaRDI portal
Publication:2269364
DOI10.1134/S003294600904005XzbMath1190.94040MaRDI QIDQ2269364
Martin Bossert, Ernst M. Gabidulin
Publication date: 16 March 2010
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items (7)
Multicomponent codes with maximum code distance ⋮ Construction of subspace codes through linkage ⋮ Constructions and bounds for mixed-dimension subspace codes ⋮ Rank subcodes in multicomponent network coding ⋮ On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes ⋮ Message encoding and retrieval for spread and cyclic orbit codes ⋮ Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces
Cites Work
- A q-analogous of the characterization of hypercubes as graphs
- Network error correction. I: Basic concepts and upper bounds
- Network error correction. II: Lower bounds
- (Secure) linear network coding multicast
- Association schemes and t-designs in regular semilattices
- An Information-Theoretic View of Network Management
- Resilient Network Coding in the Presence of Byzantine Adversaries
- Byzantine Modification Detection in Multicast Networks With Random Network Coding
- Properties and Applications of the Recurrence $F( {i + 1,k + 1,n + 1} ) = q^{k + 1} F( {i,k + 1,n} ) - q^k F( {i,k,n} )$
- The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]
- Network information flow
- Error-Correcting Codes in Projective Space
- Secure Network Coding on a Wiretap Network
- Hahn Polynomials, Discrete Harmonics, andt-Designs
This page was built for publication: Algebraic codes for network coding
