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

DOI10.3934/amc.2019029zbMath1422.51004arXiv1708.06224OpenAlexW4288997455MaRDI QIDQ2311610

Sascha Kurz, Michael Kiermaier, Daniel Heinlein, Alfred Wassermann

Publication date: 4 July 2019

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

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

zbMATH Keywords

combinatoricsfinite groupssubspace codescomputer searchfinite projective spacessubspace distanceconstant dimension codes

Mathematics Subject Classification ID

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

Related Items (5)

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

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