CONSIDERATIONS ON LOW COMPLEXITY CODES CONCERNING SYMMETRY AND CYCLICITY.

Afrati, F; Dendrinos, M

dc.contributor.author	Afrati, F	en
dc.contributor.author	Dendrinos, M	en
dc.date.accessioned	2014-03-01T02:47:37Z
dc.date.available	2014-03-01T02:47:37Z
dc.date.issued	1985	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33284
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0022300804&partnerID=40&md5=c64605e9254055adc1063fa593ccc38a	en
dc.subject.other	MATHEMATICAL TECHNIQUES - Graph Theory	en
dc.subject.other	BINARY CODES	en
dc.subject.other	CYCLICITY	en
dc.subject.other	LOW COMPLEXITY CODES	en
dc.subject.other	SYMMETRY	en
dc.subject.other	CODES, SYMBOLIC	en
dc.title	CONSIDERATIONS ON LOW COMPLEXITY CODES CONCERNING SYMMETRY AND CYCLICITY.	en
heal.type	conferenceItem	en
heal.publicationDate	1985	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.publisher	North-Holland, Amsterdam, Neth	en
heal.journalName	[No source information available]	en
dc.identifier.spage	263	en
dc.identifier.epage	268	en