Balanced Sparsest generator matrices for MDS codes

1 July 2013

conference paper
conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 1889-1893
https://doi.org/10.1109/isit.2013.6620554

Abstract

We show that given n and k, for q sufficiently large, there always exists an [n, k]_q MDS code that has a generator matrix G satisfying the following two conditions: (C1) Sparsest: each row of G has Hamming weight n - k + 1; (C2) Balanced: Hamming weights of the columns of G differ from each other by at most one.

Keywords

GENERATORS
BASE STATIONS
POLYNOMIALS
ERROR CORRECTION CODES
ENCODING
HAMMING WEIGHT

This publication has 4 references indexed in Scilit:

Error Correction for Cooperative Data Exchange
IEEE Communications Letters, 2012
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory, 2006
A Simple Proof of the Gale-Ryser Theorem
The American Mathematical Monthly, 1996
Randomized Algorithms
Published by Cambridge University Press (CUP) ,1995

Cited by 27 articles