Two methods of constructing optimum distance flag codes

DOI10.3934/AMC.2025045MaRDI QIDQ6852084zbMATH OpenFDO

Authors Xiusheng Liu, Peng Xu

Publication date 26 February 2026

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/AMC.2025045

zbMATH Keywords

\(\alpha\)-constacyclic orbit flag codesflag codesgeneralized Reed-Solomon codesnetwork coding

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite geometry and special incidence structures (51E99) Other types of codes (94B60)

Cites work

• An orbital construction of optimum distance flag codes
• Coding for Errors and Erasures in Random Network Coding
• Constacyclic codes over finite fields
• Construction of Sidon spaces with applications to coding
• Construction of subspace codes through linkage
• Constructions of cyclic constant dimension codes
• Coset Construction for Subspace Codes
• Cyclic Orbit Codes
• Cyclic orbit codes and stabilizer subfields
• Distance distributions of cyclic orbit codes
• Flag codes from planar spreads in network coding
• Flag codes of maximum distance and constructions using Singer groups
• Fundamentals of Error-Correcting Codes
• Further constructions of cyclic subspace codes
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 6765484 (Why is no real title available?)
• Linear \(\ell \)-intersection pairs of codes and their applications
• Network coding with flags
• Network information flow
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• Optimum distance flag codes from spreads via perfect matchings in graphs
• Subspace Polynomials and Cyclic Subspace Codes

This page was built for publication: Two methods of constructing optimum distance flag codes

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