Symmetric Rank Codes

Symmetric Rank Codes As is well known, a finite field $$\mathbb{K}$$ n = GF(q n ) can be described in terms of n × n matrices A over the field $$\mathbb{K}$$ = GF(q) such that their powers A i , i = 1, 2, ..., q n − 1, correspond to all nonzero elements of the field. It is proved that, for fields $$\mathbb{K}$$ n of characteristic 2, such a matrix A can be chosen to be symmetric. Several constructions of field-representing symmetric matrices are given. These matrices A i together with the all-zero matrix can be considered as a $$\mathbb{K}$$ n -linear matrix code in the rank metric with maximum rank distance d = n and maximum possible cardinality q n . These codes are called symmetric rank codes. In the vector representation, such codes are maximum rank distance (MRD) linear [n, 1, n] codes, which allows one to use known rank-error-correcting algorithms. For symmetric codes, an algorithm of erasure symmetrization is proposed, which considerably reduces the decoding complexity as compared with standard algorithms. It is also shown that a linear [n, k, d = n − k + 1] MRD code $$\mathcal{V}$$ k containing the above-mentioned one-dimensional symmetric code as a subcode has the following property: the corresponding transposed code is also $$\mathbb{K}$$ n -linear. Such codes have an extended capability of correcting symmetric errors and erasures. Problems of Information Transmission Springer Journals

Loading next page...
Kluwer Academic Publishers-Plenum Publishers
Copyright © 2004 by MAIK “Nauka/Interperiodica”
Engineering; Communications Engineering, Networks; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control
Publisher site
See Article on Publisher Site


You’re reading a free preview. Subscribe to read the entire article.

DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches


Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.



billed annually
Start Free Trial

14-day Free Trial