Article
Cited 8 time in 
Cited 10 time in 
Cited 10 time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim, HK | - |
| dc.contributor.author | Toan, PT | - |
| dc.date.accessioned | 2016-03-31T08:04:56Z | - |
| dc.date.available | 2016-03-31T08:04:56Z | - |
| dc.date.created | 2014-03-28 | - |
| dc.date.issued | 2013-11 | - |
| dc.identifier.issn | 0018-9448 | - |
| dc.identifier.other | 2013-OAK-0000029864 | - |
| dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/14519 | - |
| dc.description.abstract | Let A(n,d) (respectively A(n,d,w) ) be the maximum possible number of codewords in a binary code (respectively, binary constant-weight w code) of length n and minimum Hamming distance at least d. By adding new linear constraints to Schrijver's semidefinite programming bound, which is obtained from block-diagonalizing the Terwilliger algebra of the Hamming cube, we obtain two new upper bounds on A(n,d) , namely A(18,8) <= 71 and A(19,8) <= 131. Twenty three new upper bounds on A(n,d,w) for n <= 28 are also obtained by a similar way. | - |
| dc.description.statementofresponsibility | X | - |
| dc.language | English | - |
| dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
| dc.relation.isPartOf | IEEE TRANSACTIONS ON INFORMATION THEORY | - |
| dc.subject | Binary codes | - |
| dc.subject | binary constant-weight codes | - |
| dc.subject | linear programming | - |
| dc.subject | semidefinite programming | - |
| dc.subject | upper bound | - |
| dc.subject | CONSTANT-WEIGHT CODES | - |
| dc.title | Improved Semidefinite Programming Bound on Sizes of Codes | - |
| dc.type | Article | - |
| dc.contributor.college | 수학과 | - |
| dc.identifier.doi | 10.1109/TIT.2013.2277714 | - |
| dc.author.google | Kim, HK | - |
| dc.author.google | Toan, PT | - |
| dc.relation.volume | 59 | - |
| dc.relation.issue | 11 | - |
| dc.relation.startpage | 7337 | - |
| dc.relation.lastpage | 7345 | - |
| dc.contributor.id | 10053705 | - |
| dc.relation.journal | IEEE TRANSACTIONS ON INFORMATION THEORY | - |
| dc.relation.index | SCI급, SCOPUS 등재논문 | - |
| dc.relation.sci | SCIE | - |
| dc.collections.name | Journal Papers | - |
| dc.type.rims | ART | - |
| dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON INFORMATION THEORY, v.59, no.11, pp.7337 - 7345 | - |
| dc.identifier.wosid | 000325981100025 | - |
| dc.date.tcdate | 2019-01-01 | - |
| dc.citation.endPage | 7345 | - |
| dc.citation.number | 11 | - |
| dc.citation.startPage | 7337 | - |
| dc.citation.title | IEEE TRANSACTIONS ON INFORMATION THEORY | - |
| dc.citation.volume | 59 | - |
| dc.contributor.affiliatedAuthor | Kim, HK | - |
| dc.identifier.scopusid | 2-s2.0-84886681325 | - |
| dc.description.journalClass | 1 | - |
| dc.description.journalClass | 1 | - |
| dc.description.wostc | 4 | - |
| dc.description.scptc | 2 | * |
| dc.date.scptcdate | 2018-05-121 | * |
| dc.type.docType | Article | - |
| dc.subject.keywordAuthor | Binary codes | - |
| dc.subject.keywordAuthor | binary constant-weight codes | - |
| dc.subject.keywordAuthor | linear programming | - |
| dc.subject.keywordAuthor | semidefinite programming | - |
| dc.subject.keywordAuthor | upper bound | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
| dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Computer Science | - |
| dc.relation.journalResearchArea | Engineering | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Communities & Collection
Related Researcher
- 김현광KIM, HYUN KWANG
- Dept of Mathematics