File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

윤성환

Yoon, Sung Whan
Machine Intelligence and Information Learning Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.conferencePlace US -
dc.citation.conferencePlace Anaheim, CA -
dc.citation.endPage 3236 -
dc.citation.startPage 3231 -
dc.citation.title 2012 IEEE Global Communications Conference, GLOBECOM 2012 -
dc.contributor.author Yoon, Sung Whan -
dc.contributor.author Moon, Jaekyun -
dc.date.accessioned 2023-12-20T01:37:49Z -
dc.date.available 2023-12-20T01:37:49Z -
dc.date.created 2020-03-26 -
dc.date.issued 2012-12-03 -
dc.description.abstract This paper considers error-correcting codes designed to correct a finite set of known two-dimensional (2D) error patterns that can occur in a 2D array of bits. Obvious applications for this type of codes include storage and display devices. The specific codes designed in this paper are cyclic codes that can correct any single occurrences of dominant known error patterns that can occur anywhere in the 2D array. As example codes, rate-0.994 codes are constructed which target eight known 2D error patterns in a 63 × 63 bit array. -
dc.identifier.bibliographicCitation 2012 IEEE Global Communications Conference, GLOBECOM 2012, pp.3231 - 3236 -
dc.identifier.doi 10.1109/GLOCOM.2012.6503612 -
dc.identifier.issn 0000-0000 -
dc.identifier.scopusid 2-s2.0-84877651507 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/32840 -
dc.identifier.url https://ieeexplore.ieee.org/document/6503612/ -
dc.language 영어 -
dc.publisher Institute of Electrical and Electronics Engineers Inc. -
dc.title Two-dimensional cyclic codes correcting known error patterns -
dc.type Conference Paper -
dc.date.conferenceDate 2012-12-03 -

qrcode

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