Results 41 to 50 of about 217,546 (313)
Simple Rate-1/3 Convolutional and Tail-Biting Quantum Error-Correcting Codes [PDF]
, 2005 Simple rate-1/3 single-error-correcting unrestricted and CSS-type quantum convolutional codes are constructed from classical self-orthogonal $\F_4$-linear and $\F_2$-linear convolutional codes, respectively. These quantum convolutional codes have higher rate than comparable quantum block codes or previous quantum convolutional codes, and are simple to ...
arxiv +1 more source
Convolutional codes over finite chain rings, MDP codes and their characterization [PDF]
arXiv, 2021 In this paper, we develop the theory of convolutional codes over finite commutative chain rings. In particular, we focus on maximum distance profile (MDP) convolutional codes and we provide a characterization of these codes, generalizing the one known for fields.
arxiv
Efficient ADMM-based Algorithms for Convolutional Sparse Coding [PDF]
, 2021 Convolutional sparse coding improves on the standard sparse approximation by incorporating a global shift-invariant model. The most efficient convolutional sparse coding methods are based on the alternating direction method of multipliers and the convolution theorem.
arxiv +1 more source
The trellis complexity of convolutional codes [PDF]
Proceedings of 1995 IEEE International Symposium on Information Theory, 1996 Convolutional codes have a natural, regular, trellis structure that facilitates the implementation of Viterbi's algorithm. Linear block codes also have a natural, though not in general a regular, "minimal" trellis structure, which allows them to be decoded with a Viterbi-like algorithm.
McEliece, Robert J., Lin, Wei
openaire +7 more sources
Polarization-Adjusted Convolutional (PAC) Codes as a Concatenation of Inner Cyclic and Outer Polar- and Reed-Muller-like Codes [PDF]
arXiv, 2023 Polarization-adjusted convolutional (PAC) codes are a new family of linear block codes that can perform close to the theoretical bounds in the short block-length regime. These codes combine polar coding and convolutional coding. In this study, we show that PAC codes are equivalent to a new class of codes consisting of inner cyclic codes and outer polar-
arxiv
Generalized Weights of Convolutional Codes
IEEE Transactions on Information Theory, 2023 In 1997 Rosenthal and York defined generalized Hamming weights for convolutional codes, by regarding a convolutional code as an infinite dimensional linear code endowed with the Hamming metric. In this paper, we propose a new definition of generalized weights of convolutional codes, that takes into account the underlying module structure of the code ...
Elisa Gorla, Flavio Salizzoni
openaire +2 more sources
APPLICATION OF NON-TEST METHODS FOR CHANEL ESTIMATION
Известия высших учебных заведений России: Радиоэлектроника, 2018 The possibilities of increasing the data rate of adaptive HF communication systems by reducing redundancy in the form of test signals used for its operation are considered.
M. L. Maslakov, M. S. Smal
doaj +1 more source
A decoding algorithm for 2D convolutional codes over the erasure channel [PDF]
arXiv, 2020 Two-dimensional (2D) convolutional codes are a generalization of (1D) convolutional codes, which are very appropriate for transmission over an erasure channel. In this paper, we present a decoding algorithm for 2D convolutional codes over this kind of channel by reducing the decoding process to several decoding steps with 1D convolutional codes ...
arxiv
FEBS Open Bio, EarlyView.This review highlights how foundation models enhance predictive healthcare by integrating advanced digital twin modeling with multiomics and biomedical data. This approach supports disease management, risk assessment, and personalized medicine, with the goal of optimizing health outcomes through adaptive, interpretable digital simulations, accessible ...
Sakhaa Alsaedi +2 more
wiley +1 more source
Concatenated Reed-Solomon and Polarization-Adjusted Convolutional (PAC) Codes [PDF]
arXiv, 2021 Two concatenated coding schemes incorporating algebraic Reed-Solomon (RS) codes and polarization-adjusted convolutional (PAC) codes are proposed. Simulation results show that at a bit error rate of $10^{-5}$, a concatenated scheme using RS and PAC codes has more than $0.25$ dB coding gain over the NASA standard concatenation scheme, which uses RS and ...
arxiv