English
Related papers

Related papers: A Direct Construction of 2D-CCC with Arbitrary Arr…

200 papers

The modular composite representation (MCR) is a computing model that represents information with high-dimensional integer vectors using modular arithmetic. Originally proposed as a generalization of the binary spatter code model, it aims to…

Machine Learning · Computer Science 2025-11-14 Marco Angioli , Christopher J. Kymn , Antonello Rosato , Amy Loutfi , Mauro Olivieri , Denis Kleyko

Compute-and-forward (CAF) relaying is effective to increase bandwidth efficiency of wireless two-way relay channels. In a CAF scheme, a relay is designed to decode a linear combination composed of transmitted messages from other terminals…

Information Theory · Computer Science 2018-07-05 Satoshi Takabe , Tadashi Wadayama , Masahito Hayashi

The study of optical orthogonal codes has been motivated by an application in an optical code-division multiple access system. This paper focuses on optimal two-dimensional optical orthogonal codes with autocorrelation and cross-correlation…

Combinatorics · Mathematics 2026-02-24 Xiuling Shan , Lidong Wang , Yanxun Chang , Xiaomiao Wang

Movable antenna (MA) has emerged as a promising technology for improving the performance of wireless communication systems, which enables local movement of the antennas to create more favorable channel conditions. In this letter, we advance…

Signal Processing · Electrical Eng. & Systems 2025-01-16 Nianzu Li , Peiran Wu , Boyu Ning , Lipeng Zhu , Weidong Mei

A known Kronecker construction of completely regular codes has been investigated taking different alphabets in the component codes. This approach is also connected with lifting constructions of completely regular codes. We obtain several…

Combinatorics · Mathematics 2015-10-26 J. Rifà , V. Zinoviev

Consider the identification (ID) via channels problem, where a receiver wants to decide whether the transmitted identifier is its identifier, rather than decoding the identifier. This model allows to transmit identifiers whose size scales…

Information Theory · Computer Science 2021-06-28 Onur Günlü , Joerg Kliewer , Rafael F. Schaefer , Vladimir Sidorenko

Quasi-complementary sequence sets (QCSSs) can be seen as a generalized version of complete complementary codes (CCCs), which enables multicarrier communication systems to support more users. The contribution of this work is two-fold. First,…

Information Theory · Computer Science 2020-10-22 Avik Ranjan Adhikary , Yanghe Feng , Zhengchun Zhou , Pingzhi Fan

Context: Detecting arrays are mathematical structures aimed at fault identification in combinatorial interaction testing. However, they cannot be directly applied to systems that have constraints among test parameters. Such constraints are…

Software Engineering · Computer Science 2021-10-14 Hao Jin , Ce Shi , Tatsuhiro Tsuchiya

In this paper, we propose a capacity-approaching analog fountain code (AFC) for wireless channels. In AFC, the number of generated coded symbols is potentially limitless. In contrast to the conventional binary rateless codes, each coded…

Information Theory · Computer Science 2016-11-15 Mahyar Shirvanimoghaddam , Yonghui Li , Branka Vucetic

Despite encouraging advances in the design of relay codes, several important challenges remain. Many of the existing LDPC relay codes are tightly optimized for fixed channel conditions and not easily adapted without extensive…

Information Theory · Computer Science 2016-11-18 Thuy Van Nguyen , Aria Nosratinia , Dariush Divsalar

In 1964, Massey introduced a class of codes with complementary duals which are called Linear Complimentary Dual (LCD for short) codes. He showed that LCD codes have applications in communication system, side-channel attack (SCA) and so on.…

Information Theory · Computer Science 2017-10-06 Peter Beelen , Lingfei Jin

This paper presents a design technique for obtaining regular time-invariant low-density parity-check convolutional (RTI-LDPCC) codes with low complexity and good performance. We start from previous approaches which unwrap a low-density…

Information Theory · Computer Science 2016-11-17 Marco Baldi , Giovanni Cancellieri , Franco Chiaraluce

A constant-dimension code (CDC) is a set of subspaces of constant dimension in a common vector space with upper bounded pairwise intersection. We improve and generalize two constructions for CDCs, the improved linkage construction and the…

Combinatorics · Mathematics 2019-11-14 Daniel Heinlein

We establish a duality result between linear index coding and Locally Repairable Codes (LRCs). Specifically, we show that a natural extension of LRCs we call Generalized Locally Repairable Codes (GLCRs) are exactly dual to linear index…

Information Theory · Computer Science 2014-02-18 Karthikeyan Shanmugam , Alexandros G. Dimakis

We propose a practical network code for the wireless two-way relay channel where all nodes communicate in full duplex (FD) mode. The physical layer network coding (PNC) operation is applied with the FD operating nodes, reducing the…

Information Theory · Computer Science 2021-05-07 Semiha Tedik , Güneş Karabulut Kurt

Binary constant-weight codes have been extensively studied, due to both their numerous applications and to their theoretical significance. In particular, constant-weight codes have been proposed for error correction in store and forward. In…

Information Theory · Computer Science 2017-09-12 Maximilien Gadouleau

Large-scale floating-point matrix multiplication is a fundamental kernel in many scientific and engineering applications. Most existing work only focus on accelerating matrix multiplication on FPGA by adopting a linear systolic array. This…

Hardware Architecture · Computer Science 2018-03-13 Junzhong Shen , Yuran Qiao , You Huang , Mei Wen , Chunyuan Zhang

In this paper, we study a class of spatially coupled turbo codes, namely partially information- and partially parity-coupled turbo codes. This class of codes enjoy several advantages such as flexible code rate adjustment by varying the…

Information Theory · Computer Science 2020-12-25 Min Qiu , Xiaowei Wu , Alexandre Graell i Amat , Jinhong Yuan

We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a $d$-regular tree…

Information Theory · Computer Science 2007-07-13 Christine Kelley , Deepak Sridhara , Joachim Rosenthal

Two-way communication is a key feature in a smart grid. It is enabled by either powerline communication or wireless communication technologies. Utilizing both technologies can potentially enhance communication reliability, and many…

Information Theory · Computer Science 2017-10-31 Junmo Sung , Brian L. Evans