A new construction of anticode-optimal Grassmannian codes

MaRDI QIDQ5001000zbMATH OpenFDO

Authors Ben Paul dela Cruz, John Mark Lampos, Herbert S. Palines, Virgilio P. Sison

Publication date 16 July 2021

zbMATH Keywords

anticode boundconstant dimensionFerrers diagramGrassmannianrank-metric code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60) Bounds on codes (94B65)

Recommendations

• Equidistant codes in the Grassmannian
• Several classes of optimal Ferrers diagram rank-metric codes
• Constructions of optimal rank-metric codes from automorphisms of rational function fields
• Constructions of optimal Ferrers diagram rank metric codes
• Subspace codes from Ferrers diagrams

Cites work

• A Rank-Metric Approach to Error Control in Random Network Coding
• Coding for Errors and Erasures in Random Network Coding
• Error-Correcting Codes in Projective Space
• Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
• scientific article; zbMATH DE number 424718 (Why is no real title available?)
• Linear authentication codes: bounds and constructions
• Subspace Codes

Cited in

(4)

• Codes and anticodes in the Grassman graph
• Several classes of optimal Ferrers diagram rank-metric codes
• Quasi optimal anticodes: structure and invariants
• Quantum search algorithm for binary constant weight codes

This page was built for publication: A new construction of anticode-optimal Grassmannian codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001000)