New Improvements on the Echelon-Ferrers Construction
Anna-Lena Trautmann, Joachim Rosenthal
TL;DR
This paper presents enhancements to the echelon-Ferrers construction method for random network codes, enabling the creation of larger codes while maintaining the same minimum distance, thus improving code efficiency.
Contribution
The authors introduce novel improvements to the echelon-Ferrers construction, allowing for larger code sizes at a fixed minimum distance compared to previous methods.
Findings
Achieved larger code sizes with the improved construction.
Maintained the same minimum distance as prior constructions.
Demonstrated the effectiveness of the enhancements through theoretical analysis.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Coding theory and cryptography · Cellular Automata and Applications