Results 231 to 240 of about 268,104 (280)
Improved reconstruction of transcripts and coding sequences from RNA-seq data. [PDF]
Nucleic Acids ResGrau J +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Asymptotically dense spherical codes. I. Wrapped spherical codes
IEEE Transactions on Information Theory, 1997This paper presents new spherical code constructions (called wrapped spherical codes) that are asymptotically dense as the minimum distance tends to zero. These codes have been constructed by mapping finite subsets of sphere packings to the unit sphere in one higher dimension.
Hamkins, Jon, Zeger, Kenneth
openaire +2 more sources
Asymptotically dense spherical codes .II. laminated spherical codes
IEEE Transactions on Information Theory, 1997[For Part I, see the review Zbl 0904.94020 above.] This paper presents the construction of new spherical codes called laminated spherical codes in dimensions 2 -- 49. The technique used is similar to that of the construction of laminated lattices. Each spherical code is recursively constructed from existing spherical codes in one lower dimension.
Hamkins, Jon, Zeger, Kenneth
openaire +2 more sources
Controlled Dense Coding with Symmetric State
International Journal of Theoretical Physics, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiang, Diyou +3 more
openaire +1 more source
CONTROLLED DENSE CODING WITH CLUSTER STATE
International Journal of Quantum Information, 2012Two schemes for controlled dense coding with a one-dimensional four-particle cluster state are investigated. In this protocol, the supervisor (Cliff) can control the channel and the average amount of information transmitted from the sender (Alice) to the receiver (Bob) by adjusting the local measurement angle θ.
Huang, Guo-Qiang, Luo, Cui-Lan
openaire +2 more sources
2014 IEEE 29th Conference on Computational Complexity (CCC), 2014
The Minimum Distance Problem (MDP), i.e., the computational task of evaluating (exactly or approximately) the minimum distance of a linear code, is a well known NP-hard problem in coding theory. A key element in essentially all known proofs that MDP is NP-hard is the construction of a combinatorial object that we may call a locally dense code.
openaire +1 more source
The Minimum Distance Problem (MDP), i.e., the computational task of evaluating (exactly or approximately) the minimum distance of a linear code, is a well known NP-hard problem in coding theory. A key element in essentially all known proofs that MDP is NP-hard is the construction of a combinatorial object that we may call a locally dense code.
openaire +1 more source