Motzkin paths associated with flag codes

DOI10.1007/S11786-026-00630-YMaRDI QIDQ7315648zbMATH OpenFDO

Authors Clementa Alonso-González, Miguel Ángel Navarro-Pérez

Publication date 18 August 2026

Published in Mathematics in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11786-026-00630-Y

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Theory of error-correcting codes and error-detecting codes (94B99)

Cites work

• Bounds for flag codes
• Coding for Errors and Erasures in Random Network Coding
• Degenerate flag varieties in network coding
• Flag codes from planar spreads in network coding
• Flag codes: distance vectors and cardinality bounds
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• Maximum flag-rank distance codes
• Motzkin numbers
• Motzkin numbers
• Network coding and subspace designs
• Network coding with flags
• Network information flow
• Numerical semigroups and codes
• On Metrics for Error Correction in Network Coding
• Optimum distance flag codes from spreads via perfect matchings in graphs
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• Representation of numerical semigroups by Dyck paths.
• Subspace codes from Ferrers diagrams
• The generating function for total displacement
• The sandpile model on the complete split graph, Motzkin words, and tiered parking functions

This page was built for publication: Motzkin paths associated with flag codes

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