Gray Codes and Enumerative Coding for Vector Spaces

Gray codes for vector spaces are considered in two graphs: the Grassmann graph, and the projective-space graph, both of which have recently found applications in network coding. For the Grassmann graph, constructions of cyclic optimal codes are given for all parameters. As for the projective-space g...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 60; no. 1; pp. 271 - 281
Main Author:	Schwartz, Moshe
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.01.2014 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algebra Algorithm design and analysis Applied sciences Coding, codes Complexity theory Decoding Electrical engineering Encoding Enumerative coding Exact sciences and technology Grassmannian Gray codes Indexes Information theory Information, signal and communications theory projective-space graph Reflective binary codes Signal and communications theory Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Vectors Performance evaluation Enumerative coding Cyclic code Packet switching Gray code Graph construction projective-space graph Grassmannian Decoding Algorithm Computational complexity Vector space Gray codes Network coding Optimal code Projective space
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!