Constant Weight Codes From Constant Dimension Codes and Their Applications

Author

Chao Chen ; Xiaotian Wang ; Baoming Bai ; Guangming Shi

Author_Institution

Sch. of Electron. Eng., Xidian Univ., Xi´an, China

Volume

19

Issue

3

fYear

2015

fDate

42064

Firstpage

311

Lastpage

314

Abstract

This paper presents a geometric approach to the construction of constant weight codes from constant dimension codes. Two classes of constant weight codes are constructed based on the incidence structures in projective and Euclidean geometries, respectively. It is shown that some known optimal codes can be re-obtained in this way. As an application, the constructed codes are used in store-and-forward networks for packet loss recovery. Their decoding is translated into that of the corresponding constant dimension codes. The decoding capability is beyond that of the bounded-distance decoding. Remarkably, for constant weight codes from Koetter-Kschischang codes, the minimum-distance decoding is achieved.

Keywords

decoding; Euclidean geometries; Koetter-Kschischang codes; constant dimension codes; constant weight codes; incidence structures; minimum-distance decoding; optimal codes; packet loss recovery; projective geometries; store-and-forward networks; Decoding; Error correction; Frequency modulation; Geometry; Packet loss; Vectors; Constant weight codes; Euclidean geometry; constant dimension codes; projective geometry; store-and-forward networks;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2014.2382585

Filename

6990580