Multicomponent codes with maximum code distance

DOI10.1134/S0032946016030054zbMath1369.94615OpenAlexW2536817730MaRDI QIDQ2364473

Ernst M. Gabidulin, Nina I. Pilipchuk

Publication date: 21 July 2017

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946016030054

Mathematics Subject Classification ID

Spreads and packing problems in finite geometry (51E23) Other types of codes (94B60)

Related Items (1)

Bounds on the cardinality of subspace codes with non-maximum code distance

Cites Work

• Unnamed Item
• The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
• Johnson type bounds on constant dimension codes
• Theory of codes with maximum rank distance
• Partial t-spreads and group constructible \((s,r,\mu)\)-nets
• Partial spreads in finite projective spaces and partial designs
• Blocking sets and partial spreads in finite projective spaces
• Algebraic codes for network coding
• Coding for Errors and Erasures in Random Network Coding
• A Rank-Metric Approach to Error Control in Random Network Coding
• Linear authentication codes: bounds and constructions
• Comment on ‘An ordering policy for deteriorating items with allowable shortage and permissible delay in payment’ by Jamal, Sarker and Wang

This page was built for publication: Multicomponent codes with maximum code distance