On symmetric and Hermitian rank distance codes

by   Antonio Cossidente, et al.

Let M denote the set S_n, q of n × n symmetric matrices with entries in GF(q) or the set H_n, q^2 of n × n Hermitian matrices whose elements are in GF(q^2). Then M equipped with the rank distance d_r is a metric space. We investigate d-codes in ( M, d_r) and construct d-codes whose sizes are larger than the corresponding additive bounds. In the Hermitian case, we show the existence of an n-code of M, n even and n/2 odd, of size (3q^n-q^n/2)/2, and of a 2-code of size q^6+ q(q-1)(q^4+q^2+1)/2, for n = 3. In the symmetric case, if n is odd or if n and q are both even, we provide better upper bound on the size of a 2-code. In the case when n = 3 and q>2, a 2-code of size q^4+q^3+1 is exhibited. This provides the first infinite family of 2-codes of symmetric matrices whose size is larger than the largest possible additive 2-code.



There are no comments yet.


page 1

page 2

page 3

page 4


Linear Codes Associated to Symmetric Determinantal Varieties: Even Rank Case

We consider linear codes over a finite field 𝔽_q, for odd q, derived fro...

Rank and Kernel of F_p-Additive Generalised Hadamard Codes

A subset of a vector space F_q^n is K-additive if it is a linear space o...

Decoding of Space-Symmetric Rank Errors

This paper investigates the decoding of certain Gabidulin codes that wer...

Butson full propelinear codes

In this paper we study Butson Hadamard matrices, and codes over finite r...

Fundamental Properties of Sum-Rank Metric Codes

This paper investigates the theory of sum-rank metric codes for which th...

Computational Hardness of Certifying Bounds on Constrained PCA Problems

Given a random n × n symmetric matrix W drawn from the Gaussian orthogo...

Reconciling Similar Sets of Data

In this work, we consider the problem of synchronizing two sets of data ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.