Content-addressable memories (CAMs) enable the comparison of their entire content to a search word in one single access. Ternary CAMs (TCAMs) provide the possibility to store and handle not only 0 s and 1 s but also d...
详细信息
Content-addressable memories (CAMs) enable the comparison of their entire content to a search word in one single access. Ternary CAMs (TCAMs) provide the possibility to store and handle not only 0 s and 1 s but also don't cares. A way to protect TCAMs implemented with static random-access memory (SRAM) cells against soft-errors is proposed. Asymmetric SRAM cells are used to reduce the probability that soft-errors (a) affect don't cares and (b) corrupt 0 s and 1 s into anything else than a don't care. This implies that soft-errors will only have the tendency to generate false-hits that point to an erroneous matching word. Such a failure can be mitigated with the help of an error-correcting code (ECC), as is the case with conventional memories. Other types of failures which are more difficult to detect and locate, i.e. false-misses or false-hits that point to an error-free matching word or false-misses, become very rare or non-existent.
For many codes defined geometrically over F-q (e.g. coming from a finite complete intersection or a vector bundle on a projective variety) we prove the existence of an extension F-q(e) (no explicit lower bound for e) ...
详细信息
For many codes defined geometrically over F-q (e.g. coming from a finite complete intersection or a vector bundle on a projective variety) we prove the existence of an extension F-q(e) (no explicit lower bound for e) such that the associated code over F-q(e) has a strong uniformity property (all submatrices of a certain type have the same rank). (C) 2011 Elsevier Inc. All rights reserved.
We present a negative result of fuzzy extractors with com-putational security. Specifically, we show that, under a computational condition, a computational fuzzy extractor implies the existence of an information-theor...
详细信息
We present a negative result of fuzzy extractors with com-putational security. Specifically, we show that, under a computational condition, a computational fuzzy extractor implies the existence of an information-theoretic fuzzy extractor with slightly weaker parameters. Our result implies that to circumvent the limitations of information-theoretic fuzzy extractors, we need to employ computational fuzzy extractors that are not invertible by non-lossy functions.
Let A(n, d) denote the maximum size of a binary code with length n and minimum distance. It has been known for decades that A(16, 7) = A(17, 8) = 36 or 37, that is, that the size of optimal 3-error-correcting binary c...
详细信息
Let A(n, d) denote the maximum size of a binary code with length n and minimum distance. It has been known for decades that A(16, 7) = A(17, 8) = 36 or 37, that is, that the size of optimal 3-error-correcting binary codes of length 16 is either 36 or 37. By a recursive classification via subcodes and a clique search in the final stage, it is shown that the size of optimal such codes is 36.
Two four-error-correcting binary codes of length 21 and 22 and of cardinality 64 and 80, respectively, are constructed. The codes consist of a union of cosets of linear codes with dimension 3 and were found by a maxim...
详细信息
Two four-error-correcting binary codes of length 21 and 22 and of cardinality 64 and 80, respectively, are constructed. The codes consist of a union of cosets of linear codes with dimension 3 and were found by a maximum clique algorithm.
Low-density parity-check (LDPC) codes are widely used in communication systems for their high error-correcting performance. This survey introduces the elements of LDPC codes: decoding algorithms, code construction, en...
详细信息
Low-density parity-check (LDPC) codes are widely used in communication systems for their high error-correcting performance. This survey introduces the elements of LDPC codes: decoding algorithms, code construction, encoding algorithms, and several classes of LDPC codes.
A locally recoverable code is an error-correcting code such that any erasure in a single coordinate of a codeword can be recovered from a small subset of other coordinates. In this article we develop an algorithm that...
详细信息
A locally recoverable code is an error-correcting code such that any erasure in a single coordinate of a codeword can be recovered from a small subset of other coordinates. In this article we develop an algorithm that computes a recovery structure as concise as possible for an arbitrary linear code C and a recovery method that realizes it. This algorithm also provides the locality and the dual distance of C. Complexity issues are studied as well. Several examples are included.
In this paper, we propose a quantum private comparison scheme which can be used in decoherence noise scenario. With the combination of decoherence-free states and error-correcting code, it achieves a fault tolerant qu...
详细信息
In this paper, we propose a quantum private comparison scheme which can be used in decoherence noise scenario. With the combination of decoherence-free states and error-correcting code, it achieves a fault tolerant quantum private comparison to prevent collective decoherence noise and limited other decoherence noise. And the third party used in the protocol is not needed to be semi-honest.
The paper gives explicit parameters for several infinite families of q-ary quantum stabilizer codes. These codes are derived from combinatorial designs which arise from finite projective and affine geometries. (C) 201...
详细信息
The paper gives explicit parameters for several infinite families of q-ary quantum stabilizer codes. These codes are derived from combinatorial designs which arise from finite projective and affine geometries. (C) 2011 Elsevier Inc. All rights reserved.
暂无评论