Title :
Poster: A new approach to the Main Problem of Subspace Coding
Author :
Liu Haiteng ; Honold, Thomas
Author_Institution :
Dept. of Inf. Sci. & Electron. Eng., Zhejiang Univ., Hangzhou, China
Abstract :
Subspace codes form the appropriate mathematical setting for investigating the Koetter-Kschischang model of fault-tolerant network coding. The Main Problem of Subspace Coding asks for the determination of a subspace code of maximum size (proportional to the transmission rate) if the remaining parameters are kept fixed. We describe a new approach to finding good subspace codes, which surpasses the known size limit of lifted MRD codes and is capable of yielding an alternative construction of the currently best known binary subspace code of packet length 7, constant dimension 3 and minimum subspace distance 4.
Keywords :
binary codes; fault tolerance; network coding; Koetter-Kschischang model; MRD codes; binary subspace code; fault-tolerant network coding; maximum rank distance codes; packet length; subspace coding; subspace distance; transmission rate; Educational institutions; Electronic mail; Encoding; Information science; Network coding; Nickel; Roads; MRD code; Main Problem of Sub-space Coding; Subspace code; linear operator channel; network coding; parallelism;
Conference_Titel :
Communications and Networking in China (CHINACOM), 2014 9th International Conference on
DOI :
10.1109/CHINACOM.2014.7054392
