Results 21 to 30 of about 223,530 (281)
Soft Interference Cancellation for Random Coding in Massive Gaussian Multiple-Access
Entropy, 2021 In 2017, Polyanskiy showed that the trade-off between power and bandwidth efficiency for massive Gaussian random access is governed by two fundamentally different regimes: low power and high power. For both regimes, tight performance bounds were found by
Ralf R. Müller
doaj +1 more source
Ds-bounds for cyclic codes: new bounds for abelian codes
CoRR, 2016 In this paper we develop a technique to extend any bound for cyclic codes constructed from its defining sets (ds-bounds) to abelian (or multivariate) codes. We use this technique to improve the searching of new bounds for abelian codes.
José Joaquín Bernal +2 more
openaire +3 more sources
Bounds on List Decoding of Rank-Metric Codes [PDF]
, 2012 So far, there is no polynomial-time list decoding algorithm (beyond half the minimum distance) for Gabidulin codes. These codes can be seen as the rank-metric equivalent of Reed--Solomon codes.
Wachter-Zeh, Antonia
core +2 more sources
Discrete Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uri Blass, Iiro S. Honkala, Simon Litsyn
openaire +1 more source
Binary Fuzzy Codes and Some Properties of Hamming Distance of Fuzzy Codes
Fuzzy Information and Engineering, 2023 In this paper, we discussed binary fuzzy codes over a vector space F2n by relating classical codes with the probability of a binary symmetric channel (BSC) for receiving a sent codeword correctly. We used the weight of error patterns between a received
Mezgebu Manmekto Gereme +2 more
doaj +1 more source
Simple and general bounds on quantum random access codes [PDF]
QuantumRandom access codes are a type of communication task that is widely used in quantum information science. The optimal average success probability that can be achieved through classical strategies is known for any random access code.
Máté Farkas +2 more
doaj +1 more source
Trellis decoding complexity of linear block codes [PDF]
, 1996 In this partially tutorial paper, we examine minimal trellis representations of linear block codes and analyze several measures of trellis complexity: maximum state and edge dimensions, total span length, and total vertices, edges and mergers.
Dolinar, Samuel J, Jr. +4 more
core +1 more source
Locating and Identifying Codes in Circulant Graphs
Discrete Dynamics in Nature and Society, 2021 Identifying and locating-dominating codes have been studied widely in circulant graphs. Recently, Ville Junnila et al. (Optimal bounds on codes for location in circulant graphs, Cryptography and Communications; 2019) studied identifying and locating ...
Shu Jiao Song, Weiqian Zhang, Can Xu
doaj +1 more source
Error Exponents of LDPC Codes under Low-Complexity Decoding
Entropy, 2021 This paper deals with the specific construction of binary low-density parity-check (LDPC) codes. We derive lower bounds on the error exponents for these codes transmitted over the memoryless binary symmetric channel (BSC) for both the well-known maximum ...
Pavel Rybin +2 more
doaj +1 more source
IEEE Transactions on Information Theory, 2011 The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to infinity for fixed d=D/N and w=W/N.
Christine Bachoc +4 more
openaire +2 more sources