Constant dimension codes from Riemann-Roch spaces
type: Item
instance of: scholarly article
title: Constant dimension codes from Riemann-Roch spaces
zbMATH Open document ID: 1384.94122
author: Daniele Bartoli
author: Matteo Bonini
author: Massimo Giulietti
published in: Advances in Mathematics of Communications
publication date: 2018-01-15T00:00:00Z
full work available at URL: https://arxiv.org/abs/1508.01727
review text: Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possibly altered vector space. Then the involved codewords vector spaces. A subspace code \(C\) is a subset of the set of all subspaces of \(\mathbb{F}_q^N\). When all the subspaces of \(C\) have a fixed dimension then \(C\) is called constant dimension code. In [\textit{J. P. Hansen}, Int. J. Math. Comput. Sci. 10, No. 1, 1--11 (2015; Zbl 1384.94124)], the author presented a family of constant dimension linear network codes using algebraic curves over finite fields and certain Riemann-Roch spaces associated to divisors constructed from their rational points. In this article, the construction of Hansen is generalized to three families of codes, also of constant dimension. The three families are obtained by relaxing the conditions originally imposed by Hansen, which allows greater flexibility and variety. The parameters of the obtained codes are studied. Finally the authors give some numerical computations on the rates of the three families, showing the performance of these codes.
reviewed by: Carlos Munuera
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 51E22
zbMATH DE Number: 6826307
zbMATH Keywords: constant dimension codes
zbMATH Keywords: Riemann-Roch spaces
zbMATH Keywords: random network codes
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2963697215
arXiv ID: 1508.01727
cites work: A note on equidistant subspace codes
cites work: On subspace codes
cites work: Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
cites work: Codes and Designs Related to Lifted MRD Codes
cites work: Error-Correcting Codes in Projective Space
cites work: Constant-Rank Codes and Their Connection to Constant-Dimension Codes
cites work: Q4320535
cites work: Riemann-Roch Spaces and Linear Network Codes
cites work: Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
cites work: Coding for Errors and Erasures in Random Network Coding
cites work: A Rank-Metric Approach to Error Control in Random Network Coding
DOI: 10.3934/AMC.2017051
Recommended article: Riemann-Roch Spaces and Linear Network Codes
Recommended article: Any network code comes from an algebraic curve taking osculating spaces
Recommended article: Q5398503
Recommended article: Johnson type bounds for mixed dimension subspace codes
Recommended article: Q3755569
Recommended article: Q5267512
Recommended article: Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
Recommended article: A Rank-Metric Approach to Error Control in Random Network Coding
Recommended article: Subspace codes in \(\operatorname{PG}(2N-1; q)\)
Recommended article: Large constant dimension codes and lexicodes
description: scientific article