A new upper bound for binary codes with minimum distance four
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim J.K. | ko |
| dc.contributor.author | Hahn, Sang-Geun | ko |
| dc.date.accessioned | 2013-02-27T14:28:08Z | - |
| dc.date.available | 2013-02-27T14:28:08Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1998-06 | - |
| dc.identifier.citation | DISCRETE MATHEMATICS, v.187, no.1-3, pp.291 - 295 | - |
| dc.identifier.issn | 0012-365X | - |
| dc.identifier.uri | http://hdl.handle.net/10203/69083 | - |
| dc.description.abstract | The purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewords in a binary code of length n with minimum distance d between codewords. ？ 1998 Elsevier Science B.V. All rights reserved. | - |
| dc.language | English | - |
| dc.publisher | Elsevier BV | - |
| dc.title | A new upper bound for binary codes with minimum distance four | - |
| dc.type | Article | - |
| dc.identifier.scopusid | 2-s2.0-0042546345 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 187 | - |
| dc.citation.issue | 1-3 | - |
| dc.citation.beginningpage | 291 | - |
| dc.citation.endingpage | 295 | - |
| dc.citation.publicationname | DISCRETE MATHEMATICS | - |
| dc.contributor.localauthor | Hahn, Sang-Geun | - |
| dc.contributor.nonIdAuthor | Kim J.K. | - |
| dc.subject.keywordAuthor | Binary codes | - |
| dc.subject.keywordAuthor | One-error-corecting codes | - |
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.