Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 1,324 papers for “syndrome decoding”

Decoding Myofascial Pain Syndrome

Mustafa Murtuza · Acta Scientific Orthopaedics · 2023

Myofascial pain syndrome is a musculoskeletal system related chronic pain condition.Most people have muscle soreness at some point in their lives, which usually goes away after a few weeks.Muscle pain, however, remains in some persons.Trigger points are painful sites in patients with myofascial pain syndrome (MPS).These regions form in the muscles' tense, ropey bands (the fascia).When pressure is applied to these trigger points, pain is felt in a different place of the body (referred pain).

Cited by 0Open access

Syndrome Decoding of Convolutional Codes

J. Schalkwijk, A. J. Han Vinck · IRE Transactions on Communications Systems · 1975

The classical Viterbi decoder recursively finds the trellis path (code word) closest to the received data. Given the received data, the syndrome decoder first forms a syndrome, instead. A recursive algorithm like Viterbi's is used to determine the noise sequence of minimum Hamming weight that can be a possible cause of this syndrome. Given the estimate of the noise sequence, one derives an estimate of the original data sequence. While the bit error probability of the syndrome decoder is no different from that of the classical Viterbi decoder, the syndrome decoder can be implemented using a read only memory (ROM), thus obtaining a considerable saving in hardware.

Cited by 1Open access

Polynomial reduction from syndrome decoding problem to regular decoding problem

Pavol Zajac · Designs Codes and Cryptography · 2025

Abstract The regular decoding problem asks for (the existence of) regular solutions to a syndrome decoding problem (SDP). This problem has increased applications in post-quantum cryptography and cryptanalysis. Recently, Esser and Santini explored in depth the connection between the regular (RSD) and classical syndrome decoding problems. They have observed that while RSD to SDP reductions are known (in any parametric regime), a similar generic reduction from SDP to RSD is not known. In our contribution, we examine two different generic polynomial reductions from a syndrome decoding problem to a regular decoding problem instance. The first reduction is based on constructing a special parity check matrix that encodes weight counter progression inside the parity check matrix, which is then the input of the regular decoding oracle. The target regular decoding problem has a significantly longer code length, that depends linearly on the weight parameter of the original SDP. The second reduction is based on translating the SDP to a non-linear system of equations in the Multiple Right-Hand Sides form, and then applying RSD oracle to solve this system. The second reduction has better code length. The ratio between RSD and SDP code length of the second reduction can be bounded by a constant (less than 8).

Cited by 0Open access

Decoding Trombetti-Zhou codes: a new syndrome-based decoding approach

Chunlei Li, Angelica Piccirillo, Olga Polverino et al. · ArXiv.org · 2025

In 2019, Trombetti and Zhou introduced a new family of $\mathbb{F}_{q^n}$-linear Maximum Rank Distance (MRD) codes over $\mathbb{F}_{q^{2n}}$. For such codes we propose a new syndrome-based decoding algorithm. It is well known that a syndrome-based decoding approach relies heavily on a parity-check matrix of a linear code. Nonetheless, Trombetti-Zhou codes are not linear over the entire field $\mathbb{F}_{q^{2n}}$, but only over its subfield $\mathbb{F}_{q^{n}}$. Due to this lack of linearity, we introduce the notions of $\mathbb{F}_{q^{n}}$-generator matrix and $\mathbb{F}_{q^{n}}$-parity-check matrix for a generic $\mathbb{F}_{q^{n}}$-linear rank-metric code over $\mathbb{F}_{q^{rn}}$ in analogy with the roles that generator and parity-check matrices play in the context of linear codes. Accordingly, we present an $\mathbb{F}_{q^n}$-generator matrix and $\mathbb{F}_{q^n}$-parity-check matrix for Trombetti-Zhou codes as evaluation codes over an $\mathbb{F}_q$-basis of $\mathbb{F}_{q^{2n}}$. This relies on the choice of a particular basis called \emph{trace almost dual basis}. Subsequently, denoting by $d$ the minimum distance of the code, we show that if the rank weight $t$ of the error vector is strictly smaller than $\frac{d-1}{2}$, the syndrome-based decoding of Trombetti-Zhou codes can be converted to the decoding of Gabidulin codes of dimension one larger. On the other hand, when $t=\frac{d-1}{2}$, we reduce the decoding to determining the rank of a certain matrix. The complexity of the proposed decoding for Trombetti-Zhou codes is also discussed.

Cited by 0Open access

Reduced-Complexity Syndrome-Based TTCM Decoding

Zunaira Babar, Soon Xin Ng, Lajos Hanzo · IEEE Communications Letters · 2013

The iterative decoder of Turbo Trellis Coded Modulation (TTCM) exchanges extrinsic information between the constituent TCM decoders, which imposes a high computational complexity at the receiver. Therefore we conceive the syndrome-based block decoding of TTCM, which is capable of reducing the decoding complexity by disabling the decoder, when syndrome becomes zero. Quantitatively, we demonstrate that a decoding complexity reduction of at least 17% is attained at high SNRs, with at least 20% and 45% reduction in the 5^{th} and 6^{th} iterations, respectively.

Cited by 8

Decoding enigma: Turner syndrome with ring chromosome

D. K. Das, Debaditya Roy, Kaushik Basu et al. · Oxford Medical Case Reports · 2021

Ring chromosome X is one of the rarest with some unique phenotypical features in Turner syndrome. A young female presented to us with anasarca developed over the past 2 months due to congestive cardiac failure along with jaundice and orthopnea. She had growth retardation, intellectual disability, primary amenorrhea, lack of secondary sexual character development and dysmorphic features like low posterior hairline, shield chest and cubitus valgus. She had dilated cardiomyopathy (DCM) with intracardiac thrombus on echocardiography. Skeletal survey revealed short fourth metacarpal/tarsal on limbs. Karyotyping showed a mosaic pattern, with 45, X/46, X,r(X)(p22.3q28), i.e. Turner syndrome karyotype with ring chromosome. Her heart failure with reduced ejection fraction was managed with vasopressor along with anticoagulant and given oral contraceptive pills for hormone replacement therapy. The ring chromosomal pattern of karyotype in this patient and DCM is a rare cardiological phenomenon that can be associated with Turner syndrome, making this case a unique one.

Cited by 2Open access

Syndrome-decoding algorithms for static-diagnosis models

Yoshiteru Ishida, Hidekatsu TOKUMARU · International Journal of Systems Science · 1987

The problem of finding fault patterns consistent with a given syndrome is discussed for graph-theoretical diagnosis models such as the fault-diagnosis and self-diagnosis models. The fault-diagnosis model consists of two types of vertices, fault units and measurements, and is expressed by a bipartite graph. Faulty states of a fault unit always imply abnormal states of all the measurements which are adjacent to the unit, otherwise a measurement remains normal. A self-diagnosis model consists of one type of unit which has the capability of testing other units and being tested itself. The testing relation is represented by a directed arc; this produces test outcomes which are invalid if the testing unit is faulty. The inverse system which yields a fault pattern from a corresponding syndrome for fault-diagnosis models is studied and a syndrome-decoding algorithm is proposed which works for some class of diagnosis models with observation noise. The algorithm uses a similar measure to the syndrome-decoding algorithm of error-correcting codes which use the Hamming distance. Another measure is presented for the self-diagnosis model expressed by a directed graph and this measure is characterized by a ranking method.

Cited by 0