Results 31 to 40 of about 5,494,298 (217)
Systematic MDS erasure codes based on vandermonde matrices [PDF]
An increasing number of applications in computer communications uses erasure codes to cope with packet losses. Systematic maximum-distance separable (MDS) codes are often the best adapted codes.
Fimes, Jérôme, Lacan, Jérôme
core +2 more sources
Radar and communication integration based on complete complementary codes
In modern electronic warfare, integration of radar and communication plays an important role in maximising resource utilisation and reducing electromagnetic interference, especially for the integrated waveform design technology based on signal sharing ...
Linlin Qi, Yuan Yao, Guangxin Wu
doaj +1 more source
Analysis of Nafsatolmasdoor from the point of view of cultural semiotics [PDF]
Cultural semiotic is a concept which counts as an earlier matter for analyzing which always have been created by semioticians in order to choosing cultural elements.
Mahdi Khodadadian +1 more
doaj +1 more source
Good quantum error-correcting codes exist. [PDF]
With the realization that computers that use the interference and superposition principles of quantum mechanics might be able to solve certain problems, including prime factorization, exponentially faster than classical computers @1#, interest has been ...
A. Calderbank, P. Shor
semanticscholar +1 more source
The preferential concentration of metals into finer size fractions (
Nathaly Guerrero +3 more
doaj +1 more source
A novel secondary code acquisition algorithm for the BDS‐3 B1C signal
The BDS‐3 recently started broadcasting a new civil B1C signal to provide open services for global users, which brings benefits to GNSS‐based applications.
Tongsheng Qiu +4 more
doaj +1 more source
Finding low-weight polynomial multiples using discrete logarithm [PDF]
Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The classical algorithm to solve this problem is based on a time memory trade-off.
Domaine De Voluceau +3 more
core +5 more sources
Fast list decoders for polarization‐adjusted convolutional (PAC) codes
A latest coding scheme named polarization‐adjusted convolutional (PAC) codes is shown to approach the dispersion bound for the code (128,64) under list decoding.
Hongfei Zhu +4 more
doaj +1 more source
Decoding of Convolutional Codes over the Erasure Channel
In this paper we study the decoding capabilities of convolutional codes over the erasure channel. Of special interest will be maximum distance profile (MDP) convolutional codes. These are codes which have a maximum possible column distance increase.
Rosenthal, Joachim +2 more
core +1 more source
Deep Learning Methods for Improved Decoding of Linear Codes [PDF]
The problem of low complexity, close to optimal, channel decoding of linear codes with short to moderate block length is considered. It is shown that deep learning methods can be used to improve a standard belief propagation decoder, despite the large ...
Eliya Nachmani +5 more
semanticscholar +1 more source

