z-logo
open-access-imgOpen Access
Duality theory for space-time codes over finite fields
Author(s) -
David Grant,
Mahesh K. Varanasi
Publication year - 2008
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2008.2.35
Subject(s) - mathematics , duality (order theory) , dual polyhedron , linear code , rank (graph theory) , hamming code , finite field , vector space , discrete mathematics , block code , hamming distance , hamming weight , combinatorics , pure mathematics , algorithm , decoding methods
We further the study of the duality theory of linear space-time codes over finite fields by showing that the only finite linear temporal corre- lated codes with a duality theory are the column distance codes and the rank codes. We introduce weight enumerators for both these codes and show that they have MacWilliams-type functional equations relating them to the weight enumerators of their duals. We also show that the complete weight enumer- ator for finite linear sum-of-ranks codes satisfies such a functional equation. We produce an analogue of Gleason's Theorem for linear finite rank codes. Finally, we relate the duality matrices of n◊n linear rank codes and length n vector codes under the Hamming metric.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom