Structure of 3-infix-outfix maximal codes

Dong Yang Long; Jian Ma; Duanning Zhou

doi:10.1016/s0304-3975(97)00097-2

Structure of 3-infix-outfix maximal codes

Dong Yang Long
, Jian Ma
, Duanning Zhou

Department of Information Systems

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

6 Citations (Scopus)

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.

Original language	English
Pages (from-to)	231-240
Journal	Theoretical Computer Science
Volume	188
Issue number	1-2
DOIs	https://doi.org/10.1016/s0304-3975(97)00097-2
Publication status	Published - 30 Nov 1997

Research Keywords

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

Access Output

10.1016/s0304-3975(97)00097-2Licence: Elsevier user license

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{4b1e89d051e94d17996c5a3cda16e638,

title = "Structure of 3-infix-outfix maximal codes",

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.",

keywords = "Group codes, n-infix-outfix, n-prefix-suffix, Uniform codes",

author = "Long, \{Dong Yang\} and Jian Ma and Duanning Zhou",

year = "1997",

month = nov,

day = "30",

doi = "10.1016/s0304-3975(97)00097-2",

language = "English",

volume = "188",

pages = "231--240",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "1-2",

}

TY - JOUR

T1 - Structure of 3-infix-outfix maximal codes

AU - Long, Dong Yang

AU - Ma, Jian

AU - Zhou, Duanning

PY - 1997/11/30

Y1 - 1997/11/30

N2 - 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.

AB - 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.

KW - Group codes

KW - n-infix-outfix

KW - n-prefix-suffix

KW - Uniform codes

UR - https://www.scopus.com/pages/publications/0031274832

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0031274832&origin=recordpage

U2 - 10.1016/s0304-3975(97)00097-2

DO - 10.1016/s0304-3975(97)00097-2

M3 - RGC 21 - Publication in refereed journal

SN - 0304-3975

VL - 188

SP - 231

EP - 240

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-2

ER -

Structure of 3-infix-outfix maximal codes

Abstract

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this