Structure of 3-infix-outfix maximal codes

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

6 Scopus Citations
Scopus Metrics
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

Link(s)

DOI

DOI
Check@CityULib
Link to Scopus https://www.scopus.com/record/display.uri?eid=2-s2.0-0031274832&origin=recordpage
Permanent Link https://scholars.cityu.edu.hk/en/publications/publication(4b1e89d0-51e9-4d17-996c-5a3cda16e638).html

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

Fingerprint

Publication fingerprints text

100
Infix Keyphrases
100
Maximal Code Keyphrases
33
Group Codes Keyphrases
Full Fingerprint ›

Citation Format(s)

[ RIS ] [ BibTeX ]
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 - Publication in refereed journal › peer-review