Results 71 to 80 of about 3,225,248 (329)
On the Number of Nonequivalent Propelinear Extended Perfect Codes [PDF]
Electronic Journal of Combinatorics, 2013 The paper proves that there exists an exponential number of nonequivalent propelinear extended perfect binary codes of length growing to infinity. Specifically, it is proved that all transitive extended perfect binary codes found by Potapov (2007) are ...
J. Borges +3 more
semanticscholar +1 more source
Low-complexity trellis decoding of linear block codes. [PDF]
, 1995 The authors introduce a new simple encoding technique which allows the design of a wide variety of linear block codes. They present a number of examples in which the most widely used codes (Reed-Muller, Hamming, Golay, optimum etc.) have been designed ...
Markarian, G. S. +2 more
core
Screening Routine Clinical Notes for Epilepsy Surgery Candidates Using Large Language Models
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Epilepsy surgery is severely underutilized despite proven efficacy, with substantial under‐referral of eligible patients in routine clinical practice. This study evaluated the potential role of large language models (LLMs) as decision‐support tools for screening unstructured clinical notes to identify epilepsy surgery candidates and ...
Uriel Fennig +9 more
wiley +1 more source
Propelinear 1-Perfect Codes From Quadratic Functions [PDF]
IEEE Transactions on Information Theory, 2012 Perfect codes obtained by the Vasil'ev-Schönheim construction from a linear base code and quadratic switching functions are transitive and, moreover, propelinear.
D. Krotov, V. Potapov
semanticscholar +1 more source
Perfect binary codes: classification and properties [PDF]
, 2009 An r-perfect binary code is a subset of ℤ2n such that for any word, there is a unique codeword at Hamming distance at most r. Such a code is r-error-correcting.
Pottonen, Olli
core
A parallel Viterbi decoder for block cyclic and convolution codes
, 2005 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
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Facioscapulohumeral muscular dystrophy (FSHD) is one of the most debilitating and common muscular dystrophies. Despite its severity, no approved therapy exists for FSHD patients. However, several therapeutic candidates are currently under development, and some have recently entered clinical trials, marking the need for reliable ...
Mustafa Bilal Bayazit +11 more
wiley +1 more source
Homomorphic Logical Measurements
PRX Quantum, 2023 Shor and Steane ancillae are two well-known methods for fault-tolerant logical measurements, which are successful on small codes and their concatenations.
Shilin Huang +2 more
doaj +1 more source
Discrete Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Multiple Beamforming with Perfect Coding [PDF]
IEEE Transactions on Communications, 2012 accepted to ...
Boyu Li 0001, Ender Ayanoglu
openaire +2 more sources