Construction of Binary Array Codes Based on Matrix Transformation

  • Fuqiang Sun
  • , Guanchen He
  • , Qin Huang*
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper proposes to construct binary array codes from non-binary codes by binary matrix dispersion. Thanks to their low-density and quasi-cyclic (QC) generator matrices, the proposed codes enjoy low encoding complexity, about 1/(m+1) of the XOR operations used in their counterparts over G F (2m). Their maximum distance separable (MDS) property and repair can be efficiently analyzed via matrix transformation. The MDS property is ensured by introducing Vandermonde upper triangular form and pre-processing. Moreover, the efficient repair can be guaranteed by applying a matrix mapping called all-one superposition on the associated matrices. Analysis indicates that their code rate and repair ratio asymptotically approach those of their non-binary counterparts.

Original languageEnglish
Title of host publicationICC 2024 - IEEE International Conference on Communications
EditorsMatthew Valenti, David Reed, Melissa Torres
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1992-1997
Number of pages6
ISBN (Electronic)9781728190549
DOIs
StatePublished - 2024
Event59th Annual IEEE International Conference on Communications, ICC 2024 - Denver, United States
Duration: 9 Jun 202413 Jun 2024

Publication series

NameIEEE International Conference on Communications
ISSN (Print)1550-3607

Conference

Conference59th Annual IEEE International Conference on Communications, ICC 2024
Country/TerritoryUnited States
CityDenver
Period9/06/2413/06/24

Keywords

  • binary array codes
  • binary matrix dispersion
  • matrix transformation

Fingerprint

Dive into the research topics of 'Construction of Binary Array Codes Based on Matrix Transformation'. Together they form a unique fingerprint.

Cite this