Algebraic codes for network coding
From MaRDI portal
Recommendations
- Algebraic Algorithms for Vector Network Coding
- Network Coding Theory Via Commutative Algebra
- An Algebraic Approach to Physical-Layer Network Coding
- Algebraic Codes for Data Transmission
- scientific article; zbMATH DE number 6488188
- Algebraic coding theory
- scientific article; zbMATH DE number 4055529
- Algebraic coding theory
- scientific article; zbMATH DE number 3612939
- Deterministic Network Model Revisited: An Algebraic Network Coding Approach
Cites work
- (Secure) linear network coding multicast
- A q-analogous of the characterization of hypercubes as graphs
- An Information-Theoretic View of Network Management
- Association schemes and t-designs in regular semilattices
- Byzantine Modification Detection in Multicast Networks With Random Network Coding
- Error-Correcting Codes in Projective Space
- Hahn Polynomials, Discrete Harmonics, andt-Designs
- Network error correction. I: Basic concepts and upper bounds
- Network error correction. II: Lower bounds
- Network information flow
- 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} )$
- Resilient Network Coding in the Presence of Byzantine Adversaries
- Secure Network Coding on a Wiretap Network
- The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]
Cited in
(15)- Network coding and subspace designs
- Network coding with flags
- 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
- Multicomponent codes with maximum code distance
- Random algebraic lattices and codes for wireless communications
- Network coding with modular lattices
- 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
- Network codes
- An Algebraic Approach to Physical-Layer Network Coding
- On the Minimum Distance of Subspace Codes Generated by Linear Cellular Automata
- New constant dimension subspace codes from multilevel linkage construction
This page was built for publication: Algebraic codes for network coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269364)
