Considerations on low complexity codes concerning symmetry and cyclicity

dc.contributor.author	Δενδρινός, Μάρκος Ν.	el
dc.contributor.author	Αφράτη, Φώτο	el
dc.contributor.author	Dendrinos, Markos N.	en
dc.contributor.author	Afrati, Foto N.	en
dc.date.accessioned	2015-04-17T11:07:01Z
dc.date.available	2015-04-17T11:07:01Z
dc.date.issued	2015-04-17
dc.identifier.uri	http://hdl.handle.net/11400/8471
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://lekythos.library.ucy.ac.cy/handle/10797/13653	el
dc.subject	Graph theory
dc.subject	Symmetry (Mathematics)
dc.subject	Θεωρία Γράφημα
dc.subject	Gray codes
dc.subject	Γκρι κώδικες
dc.subject	Cyclicity
dc.subject	Κυκλικότητα
dc.subject	Low complexity codes
dc.subject	Χαμηλή κώδικες πολυπλοκότητας
dc.subject	Συμμετρία
dc.subject	Codes, Symbolic
dc.subject	Κώδικες, Συμβολική
dc.title	Considerations on low complexity codes concerning symmetry and cyclicity	en
heal.type	conferenceItem
heal.classification	Computer science
heal.classification	Mathematics
heal.classification	Πληροφορική
heal.classification	Μαθηματικά
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.classificationURI	http://zbw.eu/stw/descriptor/15045-3
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	N/A-Μαθηματικά
heal.keywordURI	http://id.loc.gov/authorities/subjects/sh85056471
heal.keywordURI	http://id.loc.gov/authorities/subjects/sh2006001303
heal.keywordURI	http://id.loc.gov/authorities/subjects/sh2007005699
heal.language	en
heal.access	campus
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Διοίκησης και Οικονομίας. Τμήμα Βιβλιοθηκονομίας και Συστημάτων Πληροφόρησης	el
heal.publicationDate	1984-07
heal.bibliographicCitation	Afrati, F. (1984). Considerations on low complexity codes concerning symmetry and cyclicity. European Meeting on Digital Techniques in Simulation Communication and Control (DIGITECH'84), IMACS (International Association for Mathematics and Computers in Simulation), pp. 263-268, Patras, July 1984. Available from: http://lekythos.library.ucy.ac.cy/handle/10797/13653	en
heal.abstract	The binary error correcting codes that are examined in this paper are codes which are constructed out of shorter subcodes. The method of construction is well described by a bipartite graph. The one set of nodes of this graph represents the single bits of a codeword of the new code, while the other set of nodes represents the subcodes; there are edges only between subcode-nodes and bit-nodes, having the interpretation that the set of bits that are connected to a specific subcode must be a codeword of this subcode. Cyclically symmetrical structures of such code constructing graphs are studied here and the positive effect of cyclic codes (when used as subcodes on such structures) on the error-correcting capability of the resulting code is demonstrated. A class of codes with error-correcting capability t equals 3 is extensively studied in a rigorous theoretical way.	en
heal.fullTextAvailability	false
heal.conferenceName	European Meeting on Digital Techniques in Simulation Communication and Control (DIGITECH'84)	en
heal.conferenceItemType	short paper