On the Optimality of the Binary Reflected Gray Code

DOI10.1109/TIT.2004.838367MaRDI QIDQ3546463zbMATH OpenOpenAlexFDO

Authors Erik Agrell, Johan Lassing, Erik G. Ström, Tony Ottosson

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2004.838367

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial codes (94B25)

Recommendations

• scientific article; zbMATH DE number 4087600
• Labelings and encoders with the uniform bit error property with applications to serially concatenated trellis codes
• The separability of Gray code (Corresp.)
• scientific article; zbMATH DE number 4139306
• Constellation labeling for linear encoders

Cited in

(3)

• LSB coded 8PSK signals
• Some classes of bipartite graphs induced by Gray codes
• Near optimal single-track Gray codes

This page was built for publication: On the Optimality of the Binary Reflected Gray Code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546463)