 On the Uncontrollability of Nonabelian Group Codes with Uncoded Group ℤ ð ‘Jorge Pedraza Arpasi Mathematical Problems in Engineering, 2011, vol. 2011, 1-12 Abstract: Error-correcting encoding is a mathematical manipulation of the information against transmission errors over noisy communications channels. One class of error-correcting codes is the so-called group codes . Presently, there are many good binary group codes which are abelian. A group code is a family of bi-infinite sequences produced by a finite state machine (FSM) homomorphic encoder defined on the extension of two finite groups. As a set of sequences, a group code is a dynamical system and it is known that well-behaved dynamical systems must be necessarily controllable. Thus, a good group code must be controllable. In this paper, we work with group codes defined over nonabelian groups. This necessity on the encoder is because it has been shown that the capacity of an additive white Gaussian noise (AWGN) channel using abelian group codes is upper bounded by the capacity of the same channel using phase shift keying (PSK) modulation eventually with different energies per symbol. We will show that when the trellis section group is nonabelian and the input group of the encoder is a cyclic group with, ð ‘ elements, ð ‘ prime, then the group code produced by the encoder is noncontrollable. Date: 2011 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:783516 DOI: 10.1155/2011/783516 Access Statistics for this article More articles in Mathematical Problems in Engineering from Hindawi |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.