English
Related papers

Related papers: Pseudo-Boolean Functions for Optimal Z-Complementa…

200 papers

Uplink grant-free non-orthogonal multiple access (NOMA) is a promising technology for massive connectivity with low latency and high energy efficiency. In code-domain NOMA schemes, the requirements boil down to the design of codebooks that…

Combinatorics · Mathematics 2025-12-22 Chunlei Li , Constanza Riera , Palash Sarkar , Pantelimon Stanica

Filter bank multiple access (FBMA) without subbands orthogonality has been proposed as a new candidate waveform to better meet the requirements of future wireless communication systems and scenarios. It has the ability to process directly…

Information Theory · Computer Science 2020-10-14 Yuhao Qi , Jian Dang , Zaichen Zhang , Liang Wu , Yongpeng Wu

A constant-amplitude code is a code that reduces the peak-to-average power ratio (PAPR) in multicode code-division multiple access (MC-CDMA) systems to the favorable value 1. In this paper quaternary constant-amplitude codes (codes over…

Information Theory · Computer Science 2009-09-24 Kai-Uwe Schmidt

The wide-band code division multiple access (WCDMA) based 3G and beyond cellular mobile wireless networks are expected to provide a diverse range of multimedia services to mobile users with guaranteed quality of service (QoS). To serve…

Networking and Internet Architecture · Computer Science 2010-07-15 K. Ayyappan , R. Kumar

Batch codes serve as critical tools for load balancing in distributed storage systems. While numerous constructions exist for specific batch sizes t, current methodologies predominantly rely on code dimension parameters, limiting their…

Information Theory · Computer Science 2025-04-29 Eldho K. Thomas

To support interference-free quasi-synchronous code-division multiple-access (QS-CDMA) communication with low spectral density profile in a cognitive radio (CR) network, it is desirable to design a set of CDMA spreading sequences with…

Information Theory · Computer Science 2016-11-17 Su Hu , Zilong Liu , Yong Liang Guan , Wenhui Xiong , Guoan Bi , Shaoqian Li

A multicarrier-division duplex (MDD)-based cell-free (CF) scheme, namely MDD-CF, is proposed, which enables downlink (DL) data and uplink (UL) data or pilots to be concurrently transmitted on mutually orthogonal subcarriers in distributed…

Information Theory · Computer Science 2022-11-01 Bohan Li , Lie-Liang Yang , Robert G. Maunder , Songlin Sun , Pei Xiao

Function-correcting codes with data protection simultaneously protect both the data and a function of the data at distinct error-correction levels. When the function receives strictly stronger protection than the data, such a code is called…

Information Theory · Computer Science 2026-04-30 Charul Rajput , B. Sundar Rajan , Ragnar Freij-Hollanti , Camilla Hollanti

In this work, we propose buffer-aided physical-layer network coding (PLNC) techniques for cooperative direct-sequence code-division multiple access systems. In the proposed buffer-aided PLNC schemes, a relay pair selection algorithm is…

Information Theory · Computer Science 2017-07-21 Jiaqi Gu , Rodrigo C. de Lamare , Mario Huemer

Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quartet Consistency (MQC) problem consists of computing a global…

Artificial Intelligence · Computer Science 2008-12-18 Antonio Morgado , Joao Marques-Silva

We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. Boolean-width is similar to rank-width, which is related to the number of $GF[2]$-sums (1+1=0) of…

Data Structures and Algorithms · Computer Science 2011-03-10 B. -M. Bui-Xuan , J. A. Telle , M. Vatshelle

We introduce a new class of rate one-half binary codes: {\bf complementary information set codes.} A binary linear code of length $2n$ and dimension $n$ is called a complementary information set code (CIS code for short) if it has two…

Information Theory · Computer Science 2016-11-15 Claude Carlet , Philippe Gaborit , Jon-Lark Kim , Patrick Solé

In this paper, we propose a fast decoder algorithm for uniquely decodable (errorless) code sets for overloaded synchronous optical code-division multiple-access (O-CDMA) systems. The proposed decoder is designed in a such a way that the…

Information Theory · Computer Science 2019-02-27 Michel Kulhandjian , Hovannes Kulhandjian , Claude D'Amours , Halim Yanikomeroglu , Gurgen Khachatrian

Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all codewords have lengths that lie in a user-specified set of…

Information Theory · Computer Science 2008-01-03 Michael B. Baer

This paper presents a methodology for ensuring that the composition of multiple Control Barrier Functions (CBFs) always leads to feasible conditions on the control input, even in the presence of input constraints. In the case of a system…

Optimization and Control · Mathematics 2023-03-24 Joseph Breeden , Dimitra Panagou

In this work, we propose a compositional framework for the construction of control barrier functions for networks of continuous-time stochastic hybrid systems enforcing complex logic specifications expressed by finite-state automata. The…

Systems and Control · Electrical Eng. & Systems 2022-06-07 Ameneh Nejati , Sadegh Soudjani , Majid Zamani

The Pseudo-Boolean Optimization (PBO) and Maximum Satisfiability (MaxSAT) problems are natural optimization extensions of Boolean Satisfiability (SAT). In the recent past, different algorithms have been proposed for PBO and for MaxSAT,…

Artificial Intelligence · Computer Science 2009-03-06 Vasco Manquinho , Joao Marques-Silva , Jordi Planes

This paper introduces a predictive control barrier function (PCBF) framework for enforcing state constraints in discrete-time systems with unknown relative degree, which can be caused by input delays or unmodeled input dynamics. Existing…

Systems and Control · Electrical Eng. & Systems 2025-10-02 Juan Augusto Paredes Salazar , James Usevitch , Ankit Goel

This paper aims to search for new optimal and sub-optimal Odd Binary Z-Complimentary Pairs (OBZCPs) for lengths up to 49. As an alternative to the celebrated binary Golay complementary pairs, optimal OBZCPs are the best almost-complementary…

Information Theory · Computer Science 2024-11-14 Peter Kazakov , Zilong Liu

This paper considers the forward error correction (FEC) code design for approaching the capacity of a dynamic multiple access channel (MAC) where both the number of users and their respective signal powers keep constantly changing,…

Information Theory · Computer Science 2019-07-22 Xiaojie Wang , Sebastian Cammerer , Stephan ten Brink
‹ Prev 1 3 4 5 6 7 10 Next ›