Spread Codes and Spread decoding in network coding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 881-885

  Manganiello, Felice ^a   Gorla, Elisa ^a   Rosenthal, Joachim ^a  

^a UNIVERSITY OF ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT DECODING ALGORITHM; INTERNATIONAL SYMPOSIUM; MINIMUM DISTANCES; NETWORK CODING; PROJECTIVE GEOMETRY; RANDOM NETWORKS;

CODES (STANDARDS); CODES (SYMBOLS); CYBERNETICS; INFORMATION THEORY; PROGRAMMING THEORY; TECHNICAL PRESENTATIONS;

DECODING;

EID: 52349114835     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595113     Document Type: Conference Paper

References (8)

1. J. J. Climent, F. J. Garcia, and V. Requena. On the construction of bent functions of 2k variables from a primitive polynomial of degree k. preprint, 2007.
2. J. von zur Gathen and J. Gerhard. Modern computer algebra. Cambridge University Press, Cambridge, second edition, 2003.
3. J. W. P. Hirschfeld. Projective Geometries over Finite Fields. Oxford Mathematical Monographs. The Clarendon Press Oxford University Press, New York, second edition, 1998.
4. R. Koetter and F. Kschischang. Coding for errors and erasures in random network coding, submitted, 2007.
5. R. Lidl and H. Niederreiter. Introduction to Finite Fields and their Applications. Cambridge University Press, Cambridge, London, 1994. Revised edition.
6. A. Montanari and R. Urbanke. Coding for network coding, submitted, 2007.
7. W. J. Martin and X. J. Zhu. Anticodes for the grassman and bilinear forms graphs. Designs, Codes and Cryptography., 6(1):73-79, July 1995.
8. D. Silva, F. Kschischang, and F. Kötter. A rank-metric approach to error control in random network coding, submitted, 2007.