LOCO Codes: Lexicographically-Ordered Constrained Codes

Date

2020-06-01

Author

Hareedy, Ahmed
Calderbank, Robert

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

49
views

0
downloads

© 1963-2012 IEEE.Line codes make it possible to mitigate interference, to prevent short pulses, and to generate streams of bipolar signals with no direct-current (DC) power content through balancing. They find application in magnetic recording (MR) devices, in Flash devices, in optical recording devices, and in some computer standards. This paper introduces a new family of fixed-length, binary constrained codes, named lexicographically-ordered constrained codes (LOCO codes), for bipolar non-return-to-zero signaling. LOCO codes are capacity-achieving, the lexicographic indexing enables simple, practical encoding and decoding, and this simplicity is demonstrated through analysis of circuit complexity. LOCO codes are easy to balance, and their inherent symmetry minimizes the rate loss with respect to unbalanced codes having the same constraints. Furthermore, LOCO codes that forbid certain patterns can be used to alleviate inter-symbol interference in MR systems and inter-cell interference in Flash systems. Numerical results demonstrate a gain of up to 10% in rate achieved by LOCO codes with respect to other practical constrained codes, including run-length-limited codes, designed for the same purpose. Simulation results suggest that it is possible to achieve a channel density gain of about 20% in MR systems by using a LOCO code to encode only the parity bits, limiting the rate loss, of a low-density parity-check code before writing.

Subject Keywords

balanced codes, Constrained codes, data storage, lexicographic ordering, magnetic recording

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85077798046&origin=inward
https://hdl.handle.net/11511/98474

Journal

IEEE Transactions on Information Theory

DOI

https://doi.org/10.1109/tit.2019.2943244

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

A New Family of Constrained Codes with Applications in Data Storage Hareedy, Ahmed; Calderbank, Robert (2019-08-01) © 2019 IEEE.Line codes make it possible to mitigate interference, to prevent short pulses, and to generate streams of bipolar signals with no direct-current (DC) power content through balancing. They find application in magnetic recording (MR) devices, in Flash devices, and in optical recording devices. This paper introduces a new family of fixed-length, binary constrained codes, named lexicographically-ordered constrained codes (LOCO codes), for bipolar non-return-to-zero signaling. LOCO codes are capacity...
Belief propagation decoding of polar codes under factor graph permutations Peker, Ahmet Gökhan; Yücel, Melek Diker; Department of Electrical and Electronics Engineering (2018) Polar codes, introduced by Arıkan, are linear block codes that can achieve the capacity of symmetric binary-input discrete memoryless channels with low encoding and decoding complexity. Polar codes of block length N are constructed by channel polarization method, which consists of channel combining and splitting operations to obtain N polarized subchannels from N copies of binary-input discrete memoryless channels. As N grows, symmetric channel capacities of the polarized subchannels converge to either 0 or...
Routing with Mutual Information Accumulation in Energy-Limited Wireless Networks Shakiba-Herfeh, Mahdi; GİRİCİ, TOLGA; Uysal, Elif (2013-09-25) We consider the problem of minimum energy unicast routing in the presence of idealistic rateless codes. The nodes on the path are able to accumulate mutual information from the transmissions of the previous nodes on the path. We first consider the case of nodes with unlimited energy and propose an algorithm that outperforms a method proposed in the recent literature. We then consider the case with limited-energy nodes. We prove by counter examples that some properties that hold in the unlimited energy case,...
Cooperative Network Coded ARQ Strategy for Broadcast Networks Tutgun, Rasit; AKTAŞ, EMRE (2015-06-12) A novel cooperative automatic repeat request (ARQ) method with network coding is proposed for broadcast networks where single source node broadcasts multiple packets to multiple destinations. Upon a failed transmission, multiple relays cooperate with the source node at the retransmission phase, where network coding is used to combine multiple lost packets. A random access mechanism is employed where retransmission is done according to back-off counters. The proposed method employs the back-off mechanism to ...
Relay Selection for Efficient HARQ-IR Protocols in Relay-Assisted Multisource Multicast Networks Quoc-Tuan Vien, Quoc-Tuan Vien; Nguyen, Huan X.; Shah, Purav; Ever, Enver; Duc To, Duc To (2014-05-21) This paper investigates relay selection for reliable data transmission in relay-assisted multisource multicast networks (RMMNs) where multiple source nodes distribute information to a set of destination nodes with the assistance of multiple relay nodes. Hybrid automatic repeat request with incremental redundancy (HARQ-IR) is used and supported by either a physical-layer network coding (PNC) or an analog network coding (ANC) technique employed at the relays. By deriving efficiency metrics of the HARQ-IR prot...

Citation Formats

A. Hareedy and R. Calderbank, “LOCO Codes: Lexicographically-Ordered Constrained Codes,” IEEE Transactions on Information Theory, vol. 66, no. 6, pp. 3572–3589, 2020, Accessed: 00, 2022. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85077798046&origin=inward.