Results 1 to 10 of about 439,555 (163)
Using T-codes as locally decodable source codes [PDF]
A locally decodable source code (LDSC) allows the recovery of arbitrary parts of an unencoded message from its encoded version, using only a part of the encoded message as input, a challenge that arises when searching within compressed data sets. Simple source codes such as Huffman codes or LempelZiv compression are not well suited to this task: A ...
Speidel, Ulrich +3 more
openaire +4 more sources
T-shift synchronization codes [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rudolf Ahlswede +4 more
openaire +1 more source
Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates [PDF]
We present several different codes and protocols to distill $T$, controlled-$S$, and Toffoli (or $CCZ$) gates. One construction is based on codes that generalize the triorthogonal codes, allowing any of these gates to be induced at the logical level by ...
Jeongwan Haah, Matthew B. Hastings
doaj +1 more source
A construction method for t-EC/AUED codes based on t-EC codes
Researches have been conducted on t(symmetric) error correcting and all undirectional error detecting (t-EC/AUED) codes. Among the t-EC/AUED codes proposed so far, most are constructed by appending additional bits to the codewords of a t error correcting (t-EC) base code.
K. Yoshida, H. Jinushi, K. Sakaniwa
+4 more sources
Neutrosophic Quadruple Algebraic Codes over Z2 and their Properties [PDF]
In this paper we for the first time develop, define and describe a new class of algebraic codes using Neutrosophic Quadruples which uses the notion of known value, and three unknown triplets (T, I, F) where T is the truth value, I is the indeterminate ...
Vasantha Kandasamy +2 more
doaj +1 more source
Girth-Based Sequential-Recovery LRCs
In this paper, we prove that a linear block code with girth $2(t+1)$ is a $t$ -sequential-recovery locally repairable codes (LRCs) with locality $r$ if its parity-check matrix has column weight at least 2 and row weight at most $r+1$ . This gives a
Zhi Jing, Hong-Yeop Song
doaj +1 more source
Group codes over binary tetrahedral group
In this article, the group algebra K[T]{\mathcal{K}}\left[{\mathscr{T}}] of the binary tetrahedral group T{\mathscr{T}} over a splitting field K{\mathcal{K}} of T{\mathscr{T}} with char(K)≠2,3{\rm{char}}\left({\mathcal{K}})\ne 2,3 is studied and the ...
Dadhwal Madhu, Pankaj
doaj +1 more source
On Optimality of CSS Codes for Transversal T [PDF]
In order to perform universal fault-tolerant quantum computation, one needs to implement a logical non-Clifford gate. Consequently, it is important to understand codes that implement such gates transversally. In this paper, we adopt an algebraic approach to characterize all stabilizer codes for which transversal $T$ and $T^{-1}$ gates preserve the ...
Narayanan Rengaswamy +3 more
openaire +2 more sources
5‐T and 6‐T thermometer‐code latches for thermometer‐code shift‐register [PDF]
AbstractThis paper proposes thermometer‐code latches having five and six transistors for unidirectional and bidirectional thermometer‐code shift‐registers, respectively. The proposed latches omit the set and reset transistors by changing from two supply voltage nodes to the set and reset signals in the cross‐coupled inverter. They set or reset the data
Ki‐Chan Woo, Byung‐Do Yang
openaire +2 more sources
A family of permutationally invariant quantum codes [PDF]
We construct a new family of permutationally invariant codes that correct $t$ Pauli errors for any $t\ge 1$. We also show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors.
Arda Aydin +2 more
doaj +1 more source

