New Improvements on the Echelon-Ferrers Construction
classification
💻 cs.IT
math.IT
keywords
codesconstructionechelon-ferrersattaindistanceetziongivenimprove
read the original abstract
We show how to improve the echelon-Ferrers construction of random network codes introduced by Etzion and Silberstein to attain codes of larger size for a given minimum distance.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.