Algebraic codes for network coding (Q2269364)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Algebraic codes for network coding	scientific article

Statements

scholarly article

0 references

Algebraic codes for network coding (English)

0 references

0 references

Ernst M. Gabidulin

0 references

Problems of Information Transmission

0 references

publication date

16 March 2010

0 references

MaRDI profile type

MaRDI publication profile

0 references

Network information flow

0 references

(Secure) linear network coding multicast

0 references

Secure Network Coding on a Wiretap Network

0 references

Byzantine Modification Detection in Multicast Networks With Random Network Coding

0 references

Resilient Network Coding in the Presence of Byzantine Adversaries

0 references

Network error correction. I: Basic concepts and upper bounds

0 references

Network error correction. II: Lower bounds

0 references

An Information-Theoretic View of Network Management

0 references

Error-Correcting Codes in Projective Space

0 references

The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]

0 references

Association schemes and t-designs in regular semilattices

0 references

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} )$

0 references

Hahn Polynomials, Discrete Harmonics, and<i>t</i>-Designs

0 references

A q-analogous of the characterization of hypercubes as graphs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1134/S003294600904005X

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2269364

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2269364&oldid=35156410"