Print Email Facebook Twitter Binary Block Codes for Noisy Channels with Unknown Offset Title Binary Block Codes for Noisy Channels with Unknown Offset Author Weber, J.H. (TU Delft Discrete Mathematics and Optimization) Bu, R. (TU Delft Discrete Mathematics and Optimization) Cai, Kui (Singapore University of Technology and Design) Schouhamer Immink, Kees A. (Turing Machines Inc.) Date 2020-07 Abstract Decoders minimizing the Euclidean distance between the received word and the candidate codewords are known to be optimal for channels suffering from Gaussian noise. However, when the stored or transmitted signals are also corrupted by an unknown offset, other decoders may perform better. In particular, applying the Euclidean distance on normalized words makes the decoding result independent of the offset. The use of this distance measure calls for alternative code design criteria in order to get good performance in the presence of both noise and offset. In this context, various adapted versions of classical binary block codes are proposed, such as (i) cosets of linear codes, (ii) (unions of) constant weight codes, and (iii) unordered codes. It is shown that considerable performance improvements can be achieved, particularly when the offset is large compared to the noise. Subject Binary block codesdecoding criterianoiseoffsetperformance evaluation To reference this document use: http://resolver.tudelft.nl/uuid:579fd628-d1d3-4cdd-8762-0e5056a1544b DOI https://doi.org/10.1109/TCOMM.2020.2986200 ISSN 0090-6778 Source IEEE Transactions on Communications, 68 (7), 3975-3983 Bibliographical note Accepted author manuscript Part of collection Institutional Repository Document type journal article Rights © 2020 J.H. Weber, R. Bu, Kui Cai, Kees A. Schouhamer Immink Files PDF IEEE_TCOM_revision_JW_RB_KC_KI.pdf 450.63 KB Close viewer /islandora/object/uuid:579fd628-d1d3-4cdd-8762-0e5056a1544b/datastream/OBJ/view