DocumentCode :
234432
Title :
Bounds on cardinality of multicomponent network codes
Author :
Afanassiev, Valentin B. ; Gabidulin, Ernst M. ; Pilipchuk, Nina I.
Author_Institution :
Inst. for Inf. Transm. Problems, Moscow, Russia
fYear :
2014
fDate :
1-5 June 2014
Firstpage :
10
Lastpage :
14
Abstract :
Network coding is a new direction of communications and information theory. Algebraic coding in this area is based on Grassmann metric known also as subspace metric. The paper is devoted to some bounds on cardinality of codes in Grassmann metric.
Keywords :
algebraic codes; network coding; Grassmann metric; algebraic coding; code cardinality; communication theory; information theory; multicomponent network code; subspace metric; Control systems; Measurement; Network coding; Redundancy; Upper bound; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Problems of Redundancy in Information and Control Systems (REDUNDANCY), 2014 XIV International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4799-4896-3
Type :
conf
DOI :
10.1109/RED.2014.7016694
Filename :
7016694
Link To Document :
بازگشت