English
Related papers

Related papers: Multi-Dimensional Spatially-Coupled Code Design: E…

200 papers

Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. In this paper, we unify all existing…

Information Theory · Computer Science 2017-10-11 Allison Beemer , Salman Habib , Christine A. Kelley , Joerg Kliewer

We use multidimensional circulant approach to construct new qutrit stabilizer $\dsb{\ell, 0, d}$ codes with parameters $(\ell, d) \in \{(51, 16), (52, 16), (54, 17), (55, 17), (57, 17)\}$ through symplectic self-dual additive codes over…

Information Theory · Computer Science 2023-12-21 Padmapani Seneviratne , Hannah Cuff , Alexandra Koletsos , Kerry Seekamp , Adrian Thananopavarn

We propose a new type of short to moderate block-length, linear error-correcting codes, called moderate-density parity-check (MDPC) codes. The number of ones of the parity-check matrix of the codes presented is typically higher than the…

Information Theory · Computer Science 2009-11-18 Samuel Ouzan , Yair Be'ery

One of the most fundamental topics in subspace coding is to explore the maximal possible value ${\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$ such that the subspace distance satisfies $\operatorname{d_S}(U,V) =…

Information Theory · Computer Science 2021-03-19 Xianmang He , Yindong Chen , Zusheng Zhang , Kunxiao Zhou

This paper analyzes general spatially-coupled (SC) systems with multi-dimensional coupling. A continuum approximation is used to derive potential functions that characterize the performance of the SC systems. For any dimension of coupling,…

Information Theory · Computer Science 2013-04-19 Keigo Takeuchi , Toshiyuki Tanaka , Kenta Kasai

In this paper, we investigate the impact of spatial coupling on the thresholds of turbo-like codes. Parallel concatenated and serially concatenated convolutional codes as well as braided convolutional codes (BCCs) are compared by means of…

Information Theory · Computer Science 2014-07-03 Michael Lentmaier , Saeedeh Moloudi , Alexandre Graell i Amat

In streaming applications, doping improves the performance of spatially-coupled low-density parity-check (SC-LDPC) codes by creating reduced-degree check nodes in the coupled chain. We formulate a scaling law to predict the bit and block…

Information Theory · Computer Science 2021-04-23 Roman Sokolovskii , Alexandre Graell i Amat , Fredrik Brännström

Sparse superimposed coding (SSC) has emerged as a promising technique for short-packet transmission in ultra-reliable low-latency communication scenarios. However, conventional SSC schemes often suffer from high encoding and decoding…

Signal Processing · Electrical Eng. & Systems 2026-01-23 Yanfeng Zhang , Xi'an Fan , Xu Zhu , Jinkai Zheng , Hui Liang , Weiwei Yang , Tom H. Luan

This paper investigates the design of self-connected spatially coupled low-density parity-check (SC-LDPC) codes. First, a termination method is proposed to reduce rate loss. Particularly, a single-side open SC-LDPC ensemble is introduced,…

Information Theory · Computer Science 2023-07-03 Yihuan Liao , Min Qiu , Jinhong Yuan

Constant dimension codes (CDCs) are essential for error correction in random network coding. A fundamental problem of CDCs is to determine their maximal possible size for given parameters. Inserting construction and multilevel construction…

Information Theory · Computer Science 2025-02-19 Han Li , Fang-Wei Fu

Convolutional sparse coding (CSC) improves sparse coding by learning a shift-invariant dictionary from the data. However, existing CSC algorithms operate in the batch mode and are expensive, in terms of both space and time, on large…

Computer Vision and Pattern Recognition · Computer Science 2018-08-01 Yaqing Wang , Quanming Yao , James T. Kwok , Lionel M. Ni

In this paper, we compare the finite-length performance of protograph-based spatially coupled low-density parity-check (SC-LDPC) codes and LDPC block codes (LDPC-BCs) over GF(q). In order to reduce computational complexity and latency, a…

Information Theory · Computer Science 2014-08-13 Kechao Huang , David G. M. Mitchell , Lai Wei , Xiao Ma , Daniel J. Costello

A new design method for high rate, fully diverse ('spherical') space frequency codes for MIMO-OFDM systems is proposed, which works for arbitrary numbers of antennas and subcarriers. The construction exploits a differential geometric…

Information Theory · Computer Science 2016-11-17 Oliver Henkel

We study the design of spectrally efficient fiber-optical communication systems based on different spatially coupled (SC) forward error correction (FEC) schemes. In particular, we optimize the allocation of the coded bits from the FEC…

Information Theory · Computer Science 2024-01-30 Christian Häger , Alexandre Graell i Amat , Fredrik Brännström , Alex Alvarado , Erik Agrell

We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches…

Information Theory · Computer Science 2024-05-30 Ferruh Ozbudak , Paolo Santonastaso , Ferdinando Zullo

This paper presents an explicit construction for an $((n,k,d=n-1), (\alpha,\beta))$ regenerating code over a field $\mathbb{F}_Q$ operating at the Minimum Storage Regeneration (MSR) point. The MSR code can be constructed to have rate $k/n$…

Information Theory · Computer Science 2016-09-20 Birenjith Sasidharan , Myna Vajha , P. Vijay Kumar

This work presents a high throughput and energy efficient multicore (MC) successive cancellation (SC) decoder architecture for polar codes. SC is a low-complexity decoding algorithm with a set of sequential operations. The sequential…

Hardware Architecture · Computer Science 2021-08-30 Altuğ Süral , Ertuğrul Kolağasıoğlu

A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and…

Information Theory · Computer Science 2007-07-13 Oliver Henkel

This paper examines the construction of low-density parity-check (LDPC) codes from transversal designs based on sets of mutually orthogonal Latin squares (MOLS). By transferring the concept of configurations in combinatorial designs to the…

Information Theory · Computer Science 2018-07-03 Alexander Gruner , Michael Huber

Recently, the sparse vector code (SVC) is emerging as a promising solution for short-packet transmission in massive machine type communication (mMTC) as well as ultra-reliable and low-latency communication (URLLC). In the SVC process, the…

Information Theory · Computer Science 2022-09-02 Linjie Yang , Pingzhi Fan
‹ Prev 1 4 5 6 7 8 10 Next ›