Perfect codes and two-graphs

Jan Kratochvíl

Commentationes Mathematicae Universitatis Carolinae (1989)

  • Volume: 030, Issue: 4, page 755-760
  • ISSN: 0010-2628

How to cite

top

Kratochvíl, Jan. "Perfect codes and two-graphs." Commentationes Mathematicae Universitatis Carolinae 030.4 (1989): 755-760. <http://eudml.org/doc/17789>.

@article{Kratochvíl1989,
author = {Kratochvíl, Jan},
journal = {Commentationes Mathematicae Universitatis Carolinae},
keywords = {t-perfect code; 2-graph; Seidel's switching},
language = {eng},
number = {4},
pages = {755-760},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {Perfect codes and two-graphs},
url = {http://eudml.org/doc/17789},
volume = {030},
year = {1989},
}

TY - JOUR
AU - Kratochvíl, Jan
TI - Perfect codes and two-graphs
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 1989
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 030
IS - 4
SP - 755
EP - 760
LA - eng
KW - t-perfect code; 2-graph; Seidel's switching
UR - http://eudml.org/doc/17789
ER -

References

top
  1. Astola J., The theory of Lee-codes, (research report), Lappeenranta, Lappeenranta Univ. of Technology, 1982. (1982) Zbl0519.94007
  2. Best M. R., A contribution to the nonexistence of perfect codes, (academisch proefschrift), Amsterdam, Math-Centrum, 1982. (1982) Zbl0526.94014MR0726757
  3. Biggs N., Perfect codes in graphs, J. Combin. Theory Ser. B 15 (1973), 289-296. (1973) Zbl0256.94009MR0325457
  4. Cameron P. J., Thas J. A., Payne S. E., Polarities of generalized hexagons and perfect codes, Geometriae Dedicata 5 (1976), 525-528. (1976) Zbl0349.05018MR0485456
  5. Dvořaková, Ruličová I., Perfect codes in regular graphs, Comment. Math. Univ. Carolinae 29 (1988), 79-83. (1988) Zbl0691.05054MR0937551
  6. Etienne G., Perfect codes and regular partitions in graphs and groups, Europ. J. Combinatorics 8 (1987), 139-144. (1987) Zbl0626.05051MR0896126
  7. Kratochvíl J., Perfect codes in general graphs, in Proceedings 7th Hungarian colloqium on Combinatorics, Eger 1987, Colloquia Math. Soc. J. Bolyai 52, pp.357-364. (1987) Zbl0688.94004MR1221574
  8. Kratochvíl J., Křivánek M., On the computational complexity of codes in graphs, to appear in Proceedings MFCS'88, Karlovy Vary 1988, Lecture Notes in Comp. Sci. 324, Springer Verlag, Berlin 1988, pp. 396-404. (1988) Zbl0655.68039MR1023443
  9. Kratochvíl J., Malý J., Matoušek J., On the existence of perfect codes m a random graph, to appear in Proceedings Random Graphs '87, Poznań 1987. (1987) Zbl0731.94017
  10. Post K. A., Nonexistence theorem on perfect Lee codes over large alphabets, Information and Control 29 (1975), 369-380. (1975) Zbl0323.94011MR0446719
  11. Seidel J. J., Graphs and 2-graplis, 5-th Southeastern Confer. on Combin., Graphs, Computing, pp. 125-143, Utilitas Math. Publ. lnc. Winnipeg, 1974. (1974) MR0364028
  12. Smith D. H., Perfect codes in the graphs O k and L ( O k ) , Glasgow Math. J. 21 (1980), 169-172. (1980) Zbl0432.05048MR0582126
  13. Tietäväinen A., On the nonexistence of perfect codes over finite fields, SIAM J. Appl. Math. 24 (1973), 88-96. (1973) Zbl0233.94004MR0325260

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.