13 research outputs found
MRD codes with maximum idealizers
Left and right idealizers are important invariants of linear rank-distance
codes. In the case of maximum rank-distance (MRD for short) codes in
the idealizers have been proved to be isomorphic to
finite fields of size at most . Up to now, the only known MRD codes with
maximum left and right idealizers are generalized Gabidulin codes, which were
first constructed in 1978 by Delsarte and later generalized by Kshevetskiy and
Gabidulin in 2005. In this paper we classify MRD codes in
for with maximum left and right idealizers
and connect them to Moore-type matrices. Apart from generalized Gabidulin
codes, it turns out that there is a further family of rank-distance codes
providing MRD ones with maximum idealizers for , odd and for ,
. These codes are not equivalent to any previously known MRD
code. Moreover, we show that this family of rank-distance codes does not
provide any further examples for .Comment: Reviewers' comments implemented, we changed the titl
Recommended from our members
To Report It You Must Be There
The John Peter Zenger Award for Freedom of the Press and the People's Right to Know, 1990, Terry A. Anderson / To Report It You Must Be There by Mort Rosenblum, The Associated Press / Tucson, Arizona, April 24, 1991Includes list of previous Zenger Award winners and foreword by George W. Ridge, Jr., University of Arizona.This title from the Zenger Awards collection is made available by the University of Arizona School of Journalism and the University of Arizona Libraries. For more information about the Zenger Awards, visit http://journalism.arizona.edu/zenger