Related papers: Lower Bounds on Conversion Bandwidth for MDS Conve…
In this thesis, we introduce the fundamental equations behind the estimation of the link budget in a communications channel, highlighting the key limitations of conventional systems. Furthermore, we investigate the use of reconfigurable…
MDS codes are elegant constructions in coding theory and have mode important applications in cryptography, network coding, distributed data storage, communication systems et. In this study, a method is given which MDS codes are lifted to a…
Reconfigurable Smart Surface (RSS) is assumed to be a key enabler for future wireless communication systems due to its ability to control the wireless propagation environment and, thus, enhance communications quality. Although optimal and…
In this paper, we study distributed storage problems over unidirectional ring networks. A lower bound on the reconstructing bandwidth to recover total original data for each user is proposed, and it is achievable for arbitrary parameters.…
Partial maximum distance separable (PMDS) codes are a kind of erasure codes where the nodes are divided into multiple groups with each forming an MDS code with a smaller code length, thus they allow repairing a failed node with only a few…
The problem of multilevel diversity coding with regeneration is considered in this work. Two new outer bounds on the optimal tradeoffs between the normalized storage capacity and repair bandwidth are established, by which the optimality of…
Maximum distance separable (MDS) and near maximum distance separable (NMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes due to their algebraic properties and excellent…
We consider $(n,k,l)$ MDS codes of length $n$, dimension $k$, and subpacketization $l$ over a finite field $\mathbb{F}$. A codeword of such a code consists of $n$ column-vectors of length $l$ over $\mathbb{F}$, with the property that any…
We continue our study of regenerating codes in distributed storage systems where connections between the nodes are constrained by a graph. In this problem, the failed node downloads the information stored at a subset of vertices of the…
Consider the following fundamental question of distributed storage networks: Given any arbitrary $(n,k,d)$ values, whether there exists an intelligent helper selection scheme (assuming unlimited memory and computing power) that can strictly…
It is an important task to construct quantum maximum-distance-separable (MDS) codes with good parameters. In the present paper, we provide six new classes of q-ary quantum MDS codes by using generalized Reed-Solomon (GRS) codes and…
Multicast/broadcast services (MBS) are able to provide video services for many users simultaneously. Fixed amount of bandwidth allocation for all of the MBS videos is not effective in terms of bandwidth utilization, overall forced call…
In this paper, we propose two novel modulation concepts based on a simple maximum distance separable (MDS) code { and show that these concepts can achieve better error performance than index modulation (IM) and related schemes.} In the…
In this paper, we analyze $m$-dimensional ($m$D) convolutional codes with finite support, viewed as a natural generalization of one-dimensional (1D) convolutional codes to higher dimensions. An $m$D convolutional code with finite support…
The reversible circuit synthesis problem can be reduced to permutation group. This allows Schreier-Sims Algorithm for the strong generating set-finding problem to be used to find tight bounds on the synthesis of 3-bit reversible circuits…
The capacity of line networks with buffer size constraints is an open, but practically important problem. In this paper, the upper bound on the achievable rate of a class of codes, called batched codes, is studied for line networks. Batched…
In this paper, we study two issues in asynchronous communication systems. The first issue is the derivation of sum capacity bounds for finite dimensional asynchronous systems. In addition, asymptotic results for the sum capacity bounds are…
The reliability of erasure-coded distributed storage systems, as measured by the mean time to data loss (MTTDL), depends on the repair bandwidth of the code. Repair-efficient codes provide reliability values several orders of magnitude…
Efficient node repair is a central requirement in distributed storage systems, particularly in high-rate erasure-coded deployments where repair traffic directly affects network overhead and recovery cost. Piggybacking codes reduce the…
The framework of Integral Quadratic Constraints of Lessard et al. (2014) reduces the computation of upper bounds on the convergence rate of several optimization algorithms to semi-definite programming (SDP). Followup work by Nishihara et…