Structure of 3-infix-outfix maximal codes

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review

5 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)231-240
Journal / PublicationTheoretical Computer Science
Volume188
Issue number1-2
Publication statusPublished - 30 Nov 1997

Abstract

This paper proves that a 3-infix-outfix code is a maximal code if and only if it is a group code, or equivalently, if and only if, it is a full uniform code. Thus, the structure for 3-infix-outfix code being a maximal code can be completely determined.

Research Area(s)

  • Group codes, n-infix-outfix, n-prefix-suffix, Uniform codes

Citation Format(s)

Structure of 3-infix-outfix maximal codes. / Long, Dong Yang; Ma, Jian; Zhou, Duanning.

In: Theoretical Computer Science, Vol. 188, No. 1-2, 30.11.1997, p. 231-240.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review