Abstract
In this paper, the theory of finite Coxeter groups is applied to group codes. The class of group codes generated by finite Coxeter groups is a generalization of the well-known permutation modulation codes of Slepian. As a main result, a simple set of linear equations is given to characterize the optimal solution to a restricted initial point problem for all these codes. In particular, it is found that Ingemarsson’s solution to the initial point problem for permutation modulation without sign changes is not always optimal. Moreover, a list of new good group codes in dimension 8 is presented. Finally, a new maximum-likelihood decoding algorithm is presented that has a reasonably low complexity and that applies to all codes generated by finite Coxeter groups.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Slepian, ‘Permutation modulation,’Proc.of the IEEE, vol. 53, no. 3, pp. 228–236, 1965.
D. Slepian, ‘Group codes for the Gaussian channel,’ Bell Syst. Tech. J., vol. 47, pp. 575–602, 1968.
I. Ingemarsson, ‘Group codes for the Gaussian channel,’ in Topics in Coding Theory, LN in Contr. and Inform. Sciences, vol. 128, pp.73–108, Springer 1989.
I. Ingema.rsson, ‘Optimized permutation modulation,’IEEE Trans. Inform. TheoryVol. 36, No. 5, pp. 1098–1100, 1990.
L.C. Grove and C.T. BensonFinite Reflection GroupsGTM 99, Springer, New York, 1985.
J.E. Humphreys, Reflection Groups and Coxeter Groups, Cambridge studies in advanced mathematics, Vol. 29, Cambridge Univ. Press, 1990.
J.L. Camenisch, ‘Group Codes from Crystallographic Reflection Groups,’ MSEE thesis, Lab. Signal-and Information Processing, ETH-Zurich, Winter 1992/93.
T. Mittelhozer and J. Lahtonen, ‘On group codes generated by finite reflection groups,’ (manuscript in preparation).
J.H. Conway and N.J.A. Sloane, Sphere Packings, Lattices and Groups, Grundlehren der math. Wissenschaften Vol. 290, Springer, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Mittelholzer, T. (1994). Construction and Decoding of Optimal Group Codes from Finite Reflection Groups. In: Blahut, R.E., Costello, D.J., Maurer, U., Mittelholzer, T. (eds) Communications and Cryptography. The Springer International Series in Engineering and Computer Science, vol 276. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2694-0_29
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2694-0_29
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6159-6
Online ISBN: 978-1-4615-2694-0
eBook Packages: Springer Book Archive