Codes and Designs Related to Lifted MRD Codes
From MaRDI portal
Publication:2989420
DOI10.1109/TIT.2012.2220119zbMATH Open1364.94597arXiv1102.2593MaRDI QIDQ2989420FDOQ2989420
Tuvi Etzion, Natalia Silberstein
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Lifted maximum rank distance (MRD) codes, which are constant dimension codes, are considered. It is shown that a lifted MRD code can be represented in such a way that it forms a block design known as a transversal design. A slightly different representation of this design makes it similar to a analog of a transversal design. The structure of these designs is used to obtain upper bounds on the sizes of constant dimension codes which contain a lifted MRD code. Codes which attain these bounds are constructed. These codes are the largest known codes for the given parameters. These transversal designs can be also used to derive a new family of linear codes in the Hamming space. Bounds on the minimum distance and the dimension of such codes are given.
Full work available at URL: https://arxiv.org/abs/1102.2593
Cited In (48)
- Parallel sub-code construction for constant-dimension codes
- Backtrack search for parallelisms of projective spaces
- On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
- New parallelisms of \(\operatorname{PG}(3,5)\) with automorphisms of order 8
- Generalized block inserting for constructing new constant dimension codes
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- q-Analogs of Packing Designs
- New constant dimension subspace codes from improved parallel subcode construction
- On point-transitive and transitive deficiency one parallelisms of \(\mathrm{PG}(3,4)\)
- Binary subspace codes in small ambient spaces
- Improved generalized block inserting construction of constant dimension codes
- New constructions of constant dimension codes by improved inserting construction
- Types of spreads and duality of the parallelisms of \(\mathrm{PG}(3,5)\) with automorphisms of order 13
- Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
- New constant dimension subspace codes from block inserting constructions
- Bilateral multilevel construction of constant dimension codes
- Book spreads in \(\mathrm{PG}(7,2)\)
- Constructions of optimal Ferrers diagram rank metric codes
- New parallelisms of \(\mathrm{PG}(3, 4)\)
- Lifted Reed-Solomon Codes and Lifted Multiplicity Codes
- Several classes of optimal Ferrers diagram rank-metric codes
- New regular parallelisms of \(\mathrm{PG}(3,5)\)
- Subspaces intersecting in at most a point
- Combining subspace codes
- Construction of subspace codes through linkage
- Constructions and bounds for mixed-dimension subspace codes
- Rank subcodes in multicomponent network coding
- Partial ‐Parallelisms in Finite Projective Spaces
- A note on equidistant subspace codes
- Almost affinely disjoint subspaces and covering Grassmannian codes
- Galois geometries and coding theory
- Subspace codes from Ferrers diagrams
- Title not available (Why is that?)
- A new approach for examining \(q\)-Steiner systems
- Orbit codes from forms on vector spaces over a finite field
- Binary additive MRD codes with minimum distance \(n-1\) must contain a semifield spread set
- Constant dimension codes from Riemann-Roch spaces
- Construction of constant dimension codes via improved inserting construction
- New Lower Bounds for Binary Constant-Dimension Subspace Codes
- Anticode-based locally repairable codes with high availability
- Message encoding and retrieval for spread and cyclic orbit codes
- On transitive parallelisms of \(\mathrm{PG}(3,4)\)
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Subspace packings: constructions and bounds
- Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects
- An asymptotically optimal construction of almost affinely disjoint subspaces
- Subspace code constructions
- Covering of subspaces by subspaces
Recommendations
- Title not available (Why is that?) 👍 👎
- Algebraic structures of MRD codes 👍 👎
- Lifted codes and their weight enumerators 👍 👎
- MRD-codes and linear sets 👍 👎
- 13. MRD codes: constructions and connections 👍 👎
- LDPC code designs, constructions, and unification 👍 👎
- Lifted Reed-Solomon Codes and Lifted Multiplicity Codes 👍 👎
- Lifted projective Reed-Solomon codes 👍 👎
- Some designs and codes from $L_2(q)$ 👍 👎
- Errata to “Codes and Designs Related to Lifted MRD Codes” [Feb 13 1004-1017] 👍 👎
This page was built for publication: Codes and Designs Related to Lifted MRD Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989420)
