Results 41 to 50 of about 523,662 (284)
An Achievable Rate-Distortion Region for the Multiple Descriptions Problem [PDF]
, 2014 A multiple-descriptions (MD) coding strategy is proposed and an inner bound to the achievable rate-distortion region is derived. The scheme utilizes linear codes.
Pradhan, Sandeep, Shirani, Farhad
core +1 more source
Linear-Complexity Overhead-Optimized Random Linear Network Codes
, 2013 Sparse random linear network coding (SRLNC) is an attractive technique proposed in the literature to reduce the decoding complexity of random linear network coding. Recognizing the fact that the existing SRLNC schemes are not efficient in terms of the required reception overhead, we consider the problem of designing overhead-optimized SRLNC schemes. To
Mahdaviani, Kaveh +2 more
openaire +2 more sources
Comparison of the Predictive Performance of Medical Coding Diagnosis Classification Systems
Technologies, 2022 Health analytics frequently involve tasks to predict outcomes of care. A foundational predictor of clinical outcomes is the medical diagnosis (Dx). The most used expression of medical Dx is the International Classification of Diseases (ICD-10-CM).
Dimitrios Zikos, Nailya DeLellis
doaj +1 more source
On the List-Decodability of Random Linear Rank-Metric Codes
, 2017 The list-decodability of random linear rank-metric codes is shown to match that of random rank-metric codes. Specifically, an $\mathbb{F}_q$-linear rank-metric code over $\mathbb{F}_q^{m \times n}$ of rate $R = (1-\rho)(1-\frac{n}{m}\rho)-\varepsilon$ is
Guruswami, Venkatesan, Resch, Nicolas
core +1 more source
Design of Non-Adaptive Querying Policies Based on Error Control Coding
IEEE Access, 2020 This paper designs non-adaptive querying policies (NQPs) for the noisy 20 questions game based on error-correction codes. The querying accuracy of a specific NQP is upper bounded by a function of the minimum distance among its codewords. As a result, the
Shuai Wang +3 more
doaj +1 more source
IEEE Open Journal of the Communications SocietyThis paper investigates nested lattice codes generated through Construction A from the ring of integers of an imaginary quadratic field. Our primary goal is to offer a streamlined proof of the existence of nested lattice codes that can attain the ...
Maryam Sadeghi +4 more
doaj +1 more source
Cell wall target fragment discovery using a low‐cost, minimal fragment library
FEBS Letters, EarlyView.LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
Punctured Low-Bias Codes Behave Like Random Linear Codes
Discrete AnalysisPunctured low-bias codes behave like random linear codes, Discrete Analysis 2024:4, 37 pp. A binary _error-correcting code_, often referred to simply as a code, is a subset $A$ of $\{0,1\}^n$ with the property that any two distinct elements of $A$ are ...
Venkatesan Guruswami, Jonathan Mosheiff
doaj +1 more source
Seismic codes based equivalent nonlinear and stochastic soil structure interaction analysis
Studia Geotechnica et Mechanica, 2020 The aim of this study is to consider the effects of the variation of shear modulus ratio (G/G0) and damping ratio (ξ) of soil, obtained by a linear iterative method based on the design spectra of seismic codes, the soil environment in terms of ...
Guellil Mohamed Elhebib +2 more
doaj +1 more source
On the list decodability of random linear codes with large error rates
, 2013 It is well known that a random q-ary code of rate \Omega(\epsilon^2) is list decodable up to radius (1 - 1/q - \epsilon) with list sizes on the order of 1/\epsilon^2, with probability 1 - o(1).
Wootters, Mary
core +1 more source