Computer Science – Information Theory
Scientific paper
2008-02-19
Computer Science
Information Theory
Improved algorithm included and paper rewritten; 26 pages
Scientific paper
The branch group of a strongly controllable group code is a shift group. We show that a shift group can be characterized in a very simple way. In addition it is shown that if a strongly controllable group code is labeled with Latin squares, a strongly controllable Latin group code, then the shift group is solvable. Moreover the mathematical structure of a Latin square (as a translation net) and the shift group of a strongly controllable Latin group code are closely related. Thus a strongly controllable Latin group code can be viewed as a natural extension of a Latin square to a sequence space. Lastly we construct shift groups. We show that it is sufficient to construct a simpler group, the state group of a shift group. We give an algorithm to find the state group, and from this it is easy to construct a stronlgy controllable Latin group code.
No associations
LandOfFree
On strongly controllable group codes and mixing group shifts: solvable groups, translation nets, and algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On strongly controllable group codes and mixing group shifts: solvable groups, translation nets, and algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On strongly controllable group codes and mixing group shifts: solvable groups, translation nets, and algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-646858