A New Approach to the Main Problem of Subspace Coding

Haiteng Liu; Thomas Honold

9th International Conference on Communications and Networking in China

Research Article

A New Approach to the Main Problem of Subspace Coding

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/icst.chinacom.2014.256469,
    author={Haiteng Liu and Thomas Honold},
    title={A New Approach to the Main Problem of Subspace Coding},
    proceedings={9th International Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2015},
    month={1},
    keywords={subspace code main problem of subspace coding network coding linear operator channel mrd code parallelism},
    doi={10.4108/icst.chinacom.2014.256469}
}

Haiteng Liu
Thomas Honold
Year: 2015
A New Approach to the Main Problem of Subspace Coding
CHINACOM
IEEE
DOI: 10.4108/icst.chinacom.2014.256469

Haiteng Liu¹^,*, Thomas Honold¹

1: Zhejiang University

*Contact email: liuhaiteng@zju.edu.cn

Abstract

Subspace codes form the ppropriate 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: subspace code main problem of subspace coding network coding linear operator channel mrd code parallelism

Published: 2015-01-21
Publisher: IEEE
Appears in: IEEEXplore

: http://dx.doi.org/10.4108/icst.chinacom.2014.256469