Subspaces intersecting in at most a point

DOI10.1007/s10623-019-00699-6zbMath1434.51006arXiv1907.02728OpenAlexW3105624231WikidataQ126653014 ScholiaQ126653014MaRDI QIDQ2302159

Sascha Kurz

Publication date: 25 February 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

finite projective geometrynetwork codingconstant dimension codes

Mathematics Subject Classification ID

Bounds on codes (94B65) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)

Related Items (3)

Subspace code constructions ⋮ The interplay of different metrics for the construction of constant dimension codes ⋮ Combining subspace codes

Cites Work

• Bilinear forms over a finite field, with applications to coding theory
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Subspace code constructions
• On Putative q-Analogues of the Fano Plane and Related Combinatorial Structures
• Codes and Designs Related to Lifted MRD Codes
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• Coding for Errors and Erasures in Random Network Coding
• A Rank-Metric Approach to Error Control in Random Network Coding
• On subspace codes

This page was built for publication: Subspaces intersecting in at most a point