A subspace code of size 333 in the setting of a binary q-analog of the Fano plane

DOI10.3934/AMC.2019029zbMATH Open1422.51004arXiv1708.06224OpenAlexW4288997455MaRDI QIDQ2311610FDOQ2311610

Authors: Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann 

Publication date: 4 July 2019

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

Abstract: We show that there is a binary subspace code of constant dimension 3 in ambient dimension 7, having minimum distance 4 and cardinality 333, i.e., $333le{A}_2(7,4;3)$, which improves the previous best known lower bound of 329. Moreover, if a code with these parameters has at least 333 elements, its automorphism group is in one of $31$ conjugacy classes. This is achieved by a more general technique for an exhaustive search in a finite group that does not depend on the enumeration of all subgroups.

Full work available at URL: https://arxiv.org/abs/1708.06224

Recommendations

• The interplay of different metrics for the construction of constant dimension codes
• Large constant dimension codes and lexicodes
• Flag codes of maximum distance and constructions using Singer groups
• New constant dimension subspace codes from block inserting constructions
• Veronese subspace codes
• New constructions of constant dimension codes by improved inserting construction
• New lower bounds on \(q\)-ary error-correcting codes
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• Subgroup subcodes
• Constructions and bounds for mixed-dimension subspace codes

zbMATH Keywords

combinatoricsfinite groupssubspace codescomputer searchfinite projective spacessubspace distanceconstant dimension codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial structures in finite projective spaces (51E20) Combinatorial codes (94B25) Triple systems (05B07)

Cited In (6)

• New and updated semidefinite programming bounds for subspace codes
• The interplay of different metrics for the construction of constant dimension codes
• Generalized vector space partitions
• On \(\alpha \)-points of \(q\)-analogs of the Fano plane
• Johnson type bounds for mixed dimension subspace codes
• Flag codes of maximum distance and constructions using Singer groups

This page was built for publication: A subspace code of size 333 in the setting of a binary \(q\)-analog of the Fano plane

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