Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On the Structure of Symmetry Groups of Vasil’ev Codes

On the Structure of Symmetry Groups of Vasil’ev Codes The structure of symmetry groups of Vasil’ev codes is studied. It is proved that the symmetry group of an arbitrary perfect binary non-full-rank Vasil’ev code of length n is always nontrivial; for codes of rank n − log(n + 1) +1, an attainable upper bound on the order of the symmetry group is obtained. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

On the Structure of Symmetry Groups of Vasil’ev Codes

Loading next page...
 
/lp/springer_journal/on-the-structure-of-symmetry-groups-of-vasil-ev-codes-rTAqFqi45w

References (14)

Publisher
Springer Journals
Copyright
Copyright © 2005 by MAIK “Nauka/Interperiodica”
Subject
Engineering; Communications Engineering, Networks; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control
ISSN
0032-9460
eISSN
1608-3253
DOI
10.1007/s11122-005-0015-5
Publisher site
See Article on Publisher Site

Abstract

The structure of symmetry groups of Vasil’ev codes is studied. It is proved that the symmetry group of an arbitrary perfect binary non-full-rank Vasil’ev code of length n is always nontrivial; for codes of rank n − log(n + 1) +1, an attainable upper bound on the order of the symmetry group is obtained.

Journal

Problems of Information TransmissionSpringer Journals

Published: Jul 15, 2005

There are no references for this article.