On equivalence of maximum additive symmetric rank-distance codes

DOI10.1007/s10623-020-00716-zzbMath1440.15018OpenAlexW3002035422WikidataQ126317143 ScholiaQ126317143MaRDI QIDQ2182060

Yanyan Li

Publication date: 21 May 2020

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

Full work available at URL: https://doi.org/10.1007/s10623-020-00716-z

zbMATH Keywords

association schemesymmetric bilinear formsemifieldmaximum rank-distance code

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Translation planes and spreads in linear incidence geometry (51A40)

Related Items (4)

Rank-Metric Codes, Semifields, and the Average Critical Problem ⋮ Symplectic 4-dimensional semifields of order \(8^4\) and \(9^4\) ⋮ On maximum additive Hermitian rank-metric codes ⋮ Encoding and decoding of several optimal rank metric codes

Cites Work

• Unnamed Item
• Unnamed Item
• Automorphism groups of Gabidulin-like codes
• Symmetric bilinear forms over finite fields with applications to coding theory
• MRD-codes and linear sets
• Theory of codes with maximum rank distance
• Bilinear forms over a finite field, with applications to coding theory
• On the number of inequivalent Gabidulin codes
• Maximum scattered linear sets and MRD-codes
• A new family of semifields with 2 parameters
• Symmetric bilinear forms over finite fields of even characteristic
• Binary additive MRD codes with minimum distance \(n-1\) must contain a semifield spread set
• On kernels and nuclei of rank metric codes
• Commutative presemifields and semifields

This page was built for publication: On equivalence of maximum additive symmetric rank-distance codes