Perfect Codes over Non-Prime Power Alphabets: An Approach Based on Diophantine Equations
Perfect error-correcting codes allow for an optimal transmission of information while guaranteeing error correction. For this reason, proving their existence has been a classical problem in both pure mathematics and information theory.
Pedro-José Cazorla García
doaj +1 more source
A parallel Viterbi decoder for block cyclic and convolution codes
We present a parallel version of Viterbi's decoding procedure, for which we are able to demonstrate that the resultant task graph has restricted complexity in that the number of communications to or from any processor cannot exceed 4 for BCH codes.
Amarasinghe, Kosala +3 more
core +1 more source
Remote Assessment of Ataxia Severity in SCA3 Across Multiple Centers and Time Points
ABSTRACT Objective Spinocerebellar ataxia type 3 (SCA3) is a genetically defined ataxia. The Scale for Assessment and Rating of Ataxia (SARA) is a clinician‐reported outcome that measures ataxia severity at a single time point. In its standard application, SARA fails to capture short‐term fluctuations, limiting its sensitivity in trials.
Marcus Grobe‐Einsler +20 more
wiley +1 more source
Blockwise Repeated Burst Error Correcting Linear Codes
This paper presents a lower and an upper bound on the number of parity check digits required for a linear code that corrects a single sub-block containing errors which are in the form of 2-repeated bursts of length b or less. An illustration of such kind
B.K. Dass, Surbhi Madan
doaj
Group Homomorphisms as Error Correcting Codes [PDF]
We investigate the minimum distance of the error correcting code formed by the homomorphisms between two finite groups $G$ and $H$. We prove some general structural results on how the distance behaves with respect to natural group operations, such as passing to subgroups and quotients, and taking products.
openaire +4 more sources
Maximum-likelihood trellis decoding technique for balanced codes. [PDF]
A low-complexity encoding and maximum-likelihood trellis decoding (MLTD) technique for nonlinear balanced codes is presented.
Markarian, G. S., Honary, B., Blaum, M.
core
Value of MRI Outcomes for Preventive and Early‐Stage Trials in Spinocerebellar Ataxias 1 and 3
ABSTRACT Objective To examine the value of MRI outcomes as endpoints for preventive and early‐stage trials of two polyglutamine spinocerebellar ataxias (SCAs). Methods A cohort of 100 participants (23 SCA1, 63 SCA3, median Scale for the Assessment and Rating of Ataxia (SARA) score = 5, 42% preataxic, and 14 gene‐negative controls) was scanned at 3T up ...
Thiago J. R. Rezende +26 more
wiley +1 more source
On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model
Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under small field size conditions. In this work, we investigate the performance of
Sundar B, Rajan, Prasad, K
core
Vestibular Patient Journey: Insights From Vestibular Disorders Association (VeDA) Registry
ABSTRACT Objective Vestibular symptoms impose a high burden of disability. Understanding real‐world diagnostic and treatment pathways can identify care gaps and guide interventions. We aimed to characterize symptom profiles, diagnostic trends, provider involvement, and treatment patterns in vestibular disorders.
Ali Rafati +10 more
wiley +1 more source
Concatenated Turbo/LDPC codes for deep space communications: performance and implementation [PDF]
Deep space communications require error correction codes able to reach extremely low bit-error-rates, possibly with a steep waterfall region and without error floor. Several schemes have been proposed in the literature to achieve these goals.
Condo, Carlo
core

