Abstract
Finding the highest possible cardinality, Aq(n,d;k), of the set of k-dimensional subspaces in Fqn, also known as codewords, is a fundamental problem in constant dimension codes (CDCs). CDCs find applications in a number of domains, including distributed storage, cryptography, and random linear network coding. The goal of recent research papers has been to establish Aq(n,d;k). We further improved the echelon-Ferrers construction with an algorithm, and enhanced the inserting construction by swapping specified columns of the generator matrix to obtain new lower bounds.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
