View : 447 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.author현종윤-
dc.date.accessioned2016-08-28T12:08:15Z-
dc.date.available2016-08-28T12:08:15Z-
dc.date.issued2010-
dc.identifier.issn0018-9448-
dc.identifier.otherOAK-6577-
dc.identifier.urihttps://dspace.ewha.ac.kr/handle/2015.oak/220790-
dc.description.abstractWe denote Qn the set of binary words of length n. A partition {C1,C2,⋯,Cr} of Qn with quotient matrix B=(bij)r×r is equitable if for all i and j, any word in Ci has exactly bij neighbors in C j. The equitable partitions of Qn can be obtained from completely regular codes. We derive a bound on equitable partitions of Q n that does not depend on the size of the partition. © 2010 IEEE.-
dc.languageEnglish-
dc.titleA bound on equitable partitions of the hamming space-
dc.typeArticle-
dc.relation.issue5-
dc.relation.volume56-
dc.relation.indexSCIE-
dc.relation.indexSCOPUS-
dc.relation.startpage2109-
dc.relation.lastpage2111-
dc.relation.journaltitleIEEE Transactions on Information Theory-
dc.identifier.doi10.1109/TIT.2010.2043773-
dc.identifier.wosidWOS:000278067900005-
dc.identifier.scopusid2-s2.0-77951576922-
dc.author.googleHyun J.Y.-
dc.contributor.scopusid현종윤(10241085100)-
dc.date.modifydate20170522131521-
Appears in Collections:
연구기관 > 수리과학연구소 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE