A GRAPH COVERING CONSTRUCTION OF ALL THE FINITE COMPLETE BIPREFIX CODES

被引：2

|

作者：

LALLEMENT, G ^{[1
]}

PERRIN, D ^{[1
]}

机构：

[1] UNIV HAUTE NORMANDIE,DEPT MATH,F-76130 MT ST AIGNAN,FRANCE

来源：

DISCRETE MATHEMATICS | 1981年 / 36卷 / 03期

关键词：

D O I：

10.1016/S0012-365X(81)80022-2

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：261 / 271

页数：11

相关论文

共 50 条

[1] Conjugacy of finite biprefix codes
Cassaigne, Julien
Karhumaki, Juhani
Salmela, Petri
[J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (24-25) : 2345 - 2351
[2] ON THE DEGREE OF FINITE MAXIMAL BIPREFIX CODES
ROSAZ, L
[J]. SEMIGROUP FORUM, 1994, 48 (03) : 327 - 331
[3] FINITE BIPREFIX SETS OF PATHS IN A GRAPH
DEFELICE, C
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 226 : 89 - 94
[4] FINITE BIPREFIX SETS OF PATHS IN A GRAPH
DEFELICE, C
[J]. THEORETICAL COMPUTER SCIENCE, 1988, 58 (1-3) : 103 - 128
[5] Covering Codes of a Graph Associated with a Finite Vector Space
M. Murtaza
I. Javaid
M. Fazil
[J]. Ukrainian Mathematical Journal, 2020, 72 : 1108 - 1117
[6] Covering Codes of a Graph Associated with a Finite Vector Space
Murtaza, M.
Javaid, I.
Fazil, M.
[J]. UKRAINIAN MATHEMATICAL JOURNAL, 2020, 72 (07) : 1108 - 1117
[7] A NEW CONSTRUCTION FOR COVERING CODES
HONKALA, IS
HAMALAINEN, HO
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) : 1343 - 1344
[8] COVERING THE COMPLETE GRAPH BY PARTITIONS
FUREDI, Z
[J]. DISCRETE MATHEMATICS, 1989, 75 (1-3) : 217 - 226
[9] ON CODES IN A COMPLETE GRAPH
Elmorsy, Hend
Alkathiry, Amani
[J]. ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2024, 41 (04):
[10] COVERING ALL CLIQUES OF A GRAPH
TUZA, Z
[J]. DISCRETE MATHEMATICS, 1990, 86 (1-3) : 117 - 126

← 1 2 3 4 5 →