Results 31 to 40 of about 469,115 (308)

The maximum cardinality of trifferent codes with lengths 5 and 6

Examples and Counterexamples, 2022
A code C⊆{0,1,2}nis said to be trifferent with length n when for any three distinct elements of C there exists a coordinate in which they all differ. Defining T(n)as the maximum cardinality of trifferent codes with length n, T(n)is unknown for n≥5.
Stefano Della Fiore, Alessandro Gnutti, Sven Polak   +2 more
doaj   +1 more source

On the \((n,t)\)-antipodal Gray codes

Theoretical Computer Science, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gerard J. Chang, Sen-Peng Eu, Chung-Heng Yeh   +2 more
openaire   +1 more source

From Magic State Distillation to Dynamical Systems [PDF]

Quantum
Magic State Distillation (MSD) has been a research focus for fault-tolerant quantum computing due to the need for non-Clifford resource in gaining quantum advantage. Although many of the MSD protocols so far are based on stabilizer codes with transversal
Yunzhe Zheng, Dong E. Liu
doaj   +1 more source

Shear Strength of Reinforced Concrete T-Beams [PDF]

Engineering and Technology Journal, 2005
This work aims at studying the behavior of concrete T-beams in shear, and comparing this work with existing codes. Forty two T-beams, obtained from the literature, have been studied in this work-32 with stirrups and 10 without.
Sarmad Al-Badri
doaj   +1 more source

On spectra of BCH codes

, 1995
Derives an estimate for the error term in the binomial approximation of spectra of BCH codes. This estimate asymptotically improves on the bounds by Sidelnikov (1971), Kasami et al. (1985), and Sole (1990)
Krasikov, I, Simon Litsyn, Litsyn, S, Ilia Krasikov   +3 more
core   +1 more source

T-Count Optimization and Reed–Muller Codes [PDF]

IEEE Transactions on Information Theory, 2019
In this paper, we study the close relationship between Reed-Muller codes and single-qubit phase gates from the perspective of $T$-count optimization. We prove that minimizing the number of $T$ gates in an $n$-qubit quantum circuit over CNOT and $T$, together with the Clifford group powers of $T$, corresponds to finding a minimum distance decoding of a ...
Matthew Amy, Michele Mosca
openaire   +2 more sources

From Product Codes to Structured Generalized LDPC Codes

, 2010
Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors.
Paolini, Enrico, Michael Lentmaier, G. Liva, G. Fettweis, Fettweis, Gerhard, Gerhard Fettweis, Lentmaier, Michael, Liva, Gianluigi, Gianluigi Liva, M. Lentmaier, Enrico Paolini   +10 more
core   +1 more source

Multicolor chromosome bar codes [PDF]

, 2006
Chromosome bar codes are multicolor banding patterns produced by fluorescence in situ hybridization (FISH) with differentially labeled and pooled sub-regional DNA probes.
Müller, Stefan, Wienberg, Johannes
core   +1 more source

Construction of Optimal Locally Repairable Codes of Triangular Association Schemes

Shanghai Jiaotong Daxue xuebao
As a new erasure code for distributed storage systems, locally repairable codes (LRCs) can effectively realize the reliable and efficient storage of massive data.
WANG Jing, LI Jinghui, YANG Jiarong, WANG E
doaj   +1 more source

Efficient T-EMS Based Decoding Algorithms for High-Order LDPC Codes

IEEE Access, 2019
Non-binary low-density parity-check (NB-LDPC) codes show larger coding gain and lower error floor than their binary counterparts in many cases. However, the existing soft decoding algorithms of NB-LDPC codes generally suffer from high computational ...
Jing Tian, Suwen Song, Jun Lin, Zhongfeng Wang   +3 more
doaj   +1 more source