Elsevier

Theoretical Computer Science

Volume 108, Issue 1, 1 February 1993, Pages 119-149
Theoretical Computer Science

Groups of finite elementary codes

https://doi.org/10.1016/0304-3975(93)90233-JGet rights and content
Under an Elsevier user license
open archive

Abstract

All permutation groups which are realizable as the groups of finite elementary codes are completely determined.

Cited by (0)