Optimal Ferrers Diagram Rank-Metric Codes
Antonia Wachter-Zeh, Tuvi Etzion
TL;DR
This paper explores optimal Ferrers diagram rank-metric codes, presenting four construction techniques that yield optimal codes for various diagrams and parameters, enhancing code design in projective space.
Contribution
It introduces four novel methods for constructing optimal Ferrers diagram rank-metric codes tailored to different diagrams and parameters.
Findings
Four construction techniques for optimal codes
Codes applicable to various Ferrers diagrams
Enhanced code performance in projective space
Abstract
Optimal rank-metric codes in Ferrers diagrams are considered. Such codes consist of matrices having zeros at certain fixed positions and can be used to construct good codes in the projective space. Four techniques and constructions of Ferrers diagram rank-metric codes are presented, each providing optimal codes for different diagrams and parameters.
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
TopicsCoding theory and cryptography · graph theory and CDMA systems · Finite Group Theory Research