Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 현종윤 | - |
dc.date.accessioned | 2016-08-28T12:08:15Z | - |
dc.date.available | 2016-08-28T12:08:15Z | - |
dc.date.issued | 2010 | - |
dc.identifier.issn | 0018-9448 | - |
dc.identifier.other | OAK-6577 | - |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/220790 | - |
dc.description.abstract | We 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.language | English | - |
dc.title | A bound on equitable partitions of the hamming space | - |
dc.type | Article | - |
dc.relation.issue | 5 | - |
dc.relation.volume | 56 | - |
dc.relation.index | SCIE | - |
dc.relation.index | SCOPUS | - |
dc.relation.startpage | 2109 | - |
dc.relation.lastpage | 2111 | - |
dc.relation.journaltitle | IEEE Transactions on Information Theory | - |
dc.identifier.doi | 10.1109/TIT.2010.2043773 | - |
dc.identifier.wosid | WOS:000278067900005 | - |
dc.identifier.scopusid | 2-s2.0-77951576922 | - |
dc.author.google | Hyun J.Y. | - |
dc.contributor.scopusid | 현종윤(10241085100) | - |
dc.date.modifydate | 20170522131521 | - |