Previous |  Up |  Next

Article

Title: 1-perfect codes over self-complementary graphs (English)
Author: Kratochvíl, Jan
Language: English
Journal: Commentationes Mathematicae Universitatis Carolinae
ISSN: 0010-2628 (print)
ISSN: 1213-7243 (online)
Volume: 26
Issue: 3
Year: 1985
Pages: 589-595
.
Category: math
.
MSC: 05C99
MSC: 94B25
idZBL: Zbl 0576.94021
idMR: MR817829
.
Date available: 2008-06-05T21:22:26Z
Last updated: 2012-04-28
Stable URL: http://hdl.handle.net/10338.dmlcz/106395
.
Reference: [1] ASTOLA J.: On perfect codes in the Lee-metric.Ann. Univ. Turku Ser. A I No. 176 (1978), 56. Zbl 0402.94039, MR 0514947
Reference: [2] BEST M. R.: Perfect codes hardly exist.IEEE Trans. Inform. Theory, Vol. IT-29, No. 3 (1983), 349-351. Zbl 0517.94013, MR 0712395
Reference: [3] BIGGS N.: Perfect codes in graphs.J. Comb. Theory Ser. B 15 (1973), 289-296. Zbl 0256.94009, MR 0325457
Reference: [4] KRATOCHVÍL J.: Perfect codes over graphs.(submitted to J. Comb. Theory Ser. B). MR 0838221
Reference: [5] POST K. A.: Nonexistence theorems on perfect Lee codes over large alphabets.Information and Control, Vol. 29 (1975), 369-380. Zbl 0323.94011, MR 0446719
Reference: [6] SMITH D. H.: Perfect codes in the graphs $0_k$ and $L(0_k)$.Glasgow Math. J. (1980), 169-172. MR 0582126
Reference: [7] TIETÄVÄINEN A.: On the nonexistence of perfect codes over finite fields.SIAM J. Appl. Math., Vol. 24 (1973), No. 1, 88-96. MR 0325260
.

Files

Files Size Format View
CommentatMathUnivCarol_026-1985-3_12.pdf 587.1Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo