| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:An almost complete description of perfect codes in direct products of cycles
Authors:ID Klavžar, Sandi (Author)
ID Špacapan, Simon (Author)
ID Žerovnik, Janez (Author)
Files:URL http://dx.doi.org/10.1016/j.aam.2005.10.002
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:PEF - Faculty of Education
Abstract:Let ▫$G = times_{i=1}^nC_{ell_i}$▫ be a direct product of cycles. It is proved that for any ▫$r ge 1$▫, and any ▫$n ge 2$▫, each connected component of ▫$G$▫ contains an ▫$r$▫-perfect code provided that each ▫$ell_i$▫ is a multiple of ▫$r^n + (r+1)^n▫$. On the other hand, if a code of ▫$G$▫ contains a given vertex and its canonical local vertices, then any ▫$ell_i$▫ is a multiple of ▫$r^n + (r+1)^n$▫. It is also proved that an ▫$r$▫-perfect code ▫$(r ge 2)$▫ of ▫$G$▫ is uniquely determined by ▫$n$▫ vertices, and it is conjectured that for ▫$r ge 2$▫ no other codes in ▫$G$▫ exist other than the constructed ones.
Keywords:mathematics, graph theory, error-correcting codes, direct product of graphs, perfect codes, cycles
Publication status:Published
Publication version:Version of Record
Publisher:Elsevier
Year of publishing:2006
Number of pages:str. 2-18
Numbering:Letn. 37, št. 1
PID:20.500.12556/DKUM-51554 New window
UDC:519.17
ISSN on article:0196-8858
COBISS.SI-ID:14026329 New window
NUK URN:URN:SI:UM:DK:Q6ZZVSAS
Publication date in DKUM:10.07.2015
Views:24348
Downloads:105
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Advances in applied mathematics
Shortened title:Adv. appl. math.
Publisher:Academic Press.
ISSN:0196-8858
COBISS.SI-ID:24885504 New window

Secondary language

Language:Slovenian
Title:Skoraj celotni opis popolnih kod v direktnih produktih ciklov
Abstract:Naj bo ▫$G = times_{i=1}^nC_{ell_i}$▫ direktni produkt ciklov. Dokazano je, da za vsak ▫$r ge 1$▫ in za vsak ▫$n ge 2$▫ velja naslednje. Če je vsak ▫$ell_i$▫ večkratnik od ▫$r^n + (r+1)^n$▫, tedaj vsaka povezana komponenta grafa ▫$G$▫ vsebuje ▫$r$▫-popolno kodo. Po drugi strani je tudi dokazano, da če koda grafa ▫$G$▫ vsebuje izbrano točko in njene lokalno kanonične točke, tedaj je vsak ▫$ell_i$▫ večkratnik od ▫$r^n + (r+1)^n$▫. Nadalje je dokazano, da je ▫$r$▫-popolna koda ▫$(r ge 2)$▫ grafa ▫$G$▫ enolično določena z ▫$n$▫ točkami. Postavljena je domneva, da za ▫$r ge 2$▫ ne obstajajo nobene druge kode v $G$ razen tistih, ki so konstruirane v članku.
Keywords:matematika, teorija grafov, korekcijske kode, direktni produkt grafov, popolne kode, cikli


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica