Related papers: Generalized Silver Codes
In the model that has become known as "Perfectly Secure Message Transmission"(PSMT), a sender Alice is connected to a receiver Bob through n parallel two-way channels. A computationally unbounded adversary Eve controls t of these channels,…
In a wireless storage system, having to communicate over a fading channel makes repair transmissions prone to physical layer errors. The first approach to combat fading is to utilize the existing optimal space-time codes. However, it was…
In this paper we present low-complexity blind multi-input multi-output (MIMO) adaptive linear multiuser receivers for direct sequence code division multiple access (DS-CDMA) systems using multiple transmit antennas and space-time block…
Recently, Guo and Xia introduced low complexity decoders called Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC), which include the Zero Forcing (ZF) and ZF-SIC receivers as special cases,…
Perfect codes in the $n$-dimensio\-nal grid $\Lambda_n$ of the lattice $\mathbb{Z}^n$ ($0<n\in\mathbb{Z}$) and its quotient toroidal grids were obtained via the truncated distance in $\mathbb{Z}^n$ given between $u=(u_1,\cdots,u_n)$ and…
Semantic communication systems for goal-oriented transmission must protect task-relevant information not only through source compression but also via physical layer mapping. Existing approaches decouple constellation design and semantic…
The variances of matched and sidelobe free mismatched filter estimators are given for arbitrary coherent targets in the case of aperiodic transmission. It is shown that mismatched filtering is often better than matched filtering in terms of…
A joint scheme for the channel coding and spectrum spreading communication system is proposed in this paper. The Bit Error Rate (BER) performance of the joint proposed scheme is evaluated and compared with the case of channel coding scheme…
In this paper we propose a new cooperative packet transmission scheme that allows independent sources to superimpose over-the-air their packet transmissions. Relay nodes are used and cooperative diversity is combined with distributed…
We propose two coding schemes for the two-receiver discrete memoryless broadcast channel (BC) with rate-limited feedback from one or both receivers. They improve over the nofeedback capacity region for a large class of channels, including…
Complete complementary codes (CCCs) are highly valuable in the fields of information security, radar and communication. The spectrally null constrained (SNC) problem arises in radar and modern communication systems due to the reservation or…
We develop two new designs of unitary differential space-time modulation (DSTM) with low decoding complexity. Their decoder can be separated into a few parallel decoders, each of which has a decoding search space of less than sqrt(N) if the…
A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase based cooperative diversity protocols of Jing-Hassibi and the…
Supporting ultra-reliable and low-latency communication (URLLC) is a challenge in current wireless systems. Channel codes that generate large codewords improve reliability but necessitate the use of interleavers, which introduce undesirable…
The problem of securing a network coding communication system against an eavesdropper adversary is considered. The network implements linear network coding to deliver n packets from source to each receiver, and the adversary can eavesdrop…
We define a new family of codes for symmetric classical-quantum channels and establish their optimality. To this end, we extend the classical notion of generalized perfect and quasi-perfect codes to channels defined over some finite…
A Quasi-Orthogonal Space-Time Block Code (QO-STBC) is attractive because it achieves higher code rate than Orthogonal STBC and lower decoding complexity than nonorthogonal STBC. In this paper, we first derive the algebraic structure of…
Reducing computational complexity of the modern wireless communication systems such as massive Multiple-Input Multiple-Output (MIMO) configurations is of utmost interest. In this paper, we propose new algorithm that can be used to…
Complex orthogonal design (COD) with parameter $[p, n, k]$ is a combinatorial design used in space-time block codes (STBCs). For STBC, $n$ is the number of antennas, $k/p$ is the rate, and $p$ is the decoding delay. A class of rate $1/2$…
In this paper, we propose systematic block Markov superposition transmission of repetition~(BMST-R) codes, which can support a wide range of code rates but maintain essentially the same encoding/decoding hardware structure. The systematic…