Results 31 to 40 of about 162,952 (114)

Complexity Analysis of Reed-Solomon Decoding over GF(2^m) Without Using Syndromes [PDF]

open access: yesarXiv, 2008
For the majority of the applications of Reed-Solomon (RS) codes, hard decision decoding is based on syndromes. Recently, there has been renewed interest in decoding RS codes without using syndromes. In this paper, we investigate the complexity of syndromeless decoding for RS codes, and compare it to that of syndrome-based decoding.
arxiv  

Differential Light Shift Cancellation in a Magnetic-Field-Insensitive Transition of $^{87}$Rb [PDF]

open access: yes, 2010
We demonstrate near-complete cancellation of the differential light shift of a two-photon magnetic-field-insensitive microwave hyperfine (clock) transition in $^{87}$Rb atoms trapped in an optical lattice. Up to $95(2)%$ of the differential light shift is canceled while maintaining magnetic-field insensitivity.
arxiv   +1 more source

Strabismic syndromes and syndromic strabismus - a brief review [PDF]

open access: yesarXiv, 2015
Strabismus can be found in association with congenital heart diseases, for examples, in velocardiofacial (DiGeorge) syndrome, Down syndrome, mild dysmorphic features, in CHARGE association, Turner syndrome, Ullrich-Turner syndrome, cardiofaciocutaneous syndrome.1-4 Some types of strabismus is heritable (e.g.
arxiv  

No effects of androgen receptor gene CAG and GGC repeat polymorphisms on digit ratio (2D:4D): Meta-analysis [PDF]

open access: yesarXiv, 2013
Objectives: A series of meta-analyses assessed whether differentially efficacious variants (CAG and GGC repeat-length polymorphisms) of the human androgen receptor gene are associated with digit ratio (2D:4D), a widely investigated putative pointer to prenatal androgen action.
arxiv  

Hardness of decoding quantum stabilizer codes [PDF]

open access: yesarXiv, 2013
In this article we address the computational hardness of optimally decoding a quantum stabilizer code. Much like classical linear codes, errors are detected by measuring certain check operators which yield an error syndrome, and the decoding problem consists of determining the most likely recovery given the syndrome. The corresponding classical problem
arxiv  

Block Network Error Control Codes and Syndrome-based Complete Maximum Likelihood Decoding [PDF]

open access: yesarXiv, 2008
In this paper, network error control coding is studied for robust and efficient multicast in a directed acyclic network with imperfect links. The block network error control coding framework, BNEC, is presented and the capability of the scheme to correct a mixture of symbol errors and packet erasures and to detect symbol errors is studied.
arxiv  

Quantum Error-Correcting Codes Need Not Completely Reveal the Error Syndrome [PDF]

open access: yesarXiv, 1996
Quantum error-correcting codes so far proposed have not worked in the presence of noise which introduces more than one bit of entropy per qubit sent through a quantum channel, nor can any code which identifies the complete error syndrome. We describe a code which does not find the complete error syndrome and can be used for reliable transmission of ...
arxiv  

A Unified Perspective on Parity- and Syndrome-Based Binary Data Compression Using Off-the-Shelf Turbo Codecs [PDF]

open access: yesarXiv, 2009
We consider the problem of compressing memoryless binary data with or without side information at the decoder. We review the parity- and the syndrome-based approaches and discuss their theoretical limits, assuming that there exists a virtual binary symmetric channel between the source and the side information, and that the source is not necessarily ...
arxiv  

Infinitesimal Perturbation Analysis for Personalized Cancer Therapy Design [PDF]

open access: yesarXiv, 2015
We use a Stochastic Hybrid Automaton (SHA) model of prostate cancer evolution under intermittent androgen suppression (IAS) to study a threshold-based policy for therapy design. IAS is currently one of the most widely used treatments for advanced prostate cancer.
arxiv  

Home - About - Disclaimer - Privacy