1,782,123 Hits in 3.8 sec

Correct Code Containing Containers [chapter]

Claire Dross, Jean-Christophe Filliâtre, Yannick Moy
2011 Lecture Notes in Computer Science  
Correct usage of containers and user-provided correctness properties can be checked either by execution during testing or by formal proof with an automatic prover.  ...  As standards like DO-178C put formal verification and testing on an equal footing, it is important to give users the ability to apply both to the verification of code using containers.  ...  Properties over containers offer a high level description of the code, suitable for expressing partial correctness in the form of code contracts.  ... 
doi:10.1007/978-3-642-21768-5_9 fatcat:ikzhlgvlmvavpin525xqz6oq2i

Page 44 of IBM Journal of Research and Development Vol. 4, Issue 1 [page]

1960 IBM Journal of Research and Development  
If min d=2m-+ 2, any error pattern containing m or fewer errors can be corrected. In addition, any error pattern containing (m-+1) errors can be detected.  ...  MacDonald Design Methods for Maximum Minimum-Distance Error-Correcting Codes’ Abstract: In error-correcting codes for combating noisy transmission channels, a central concept is the notion of minimum distance  ... 

On perfect deletion-correcting codes

Andreas Klein
2003 Journal of combinatorial designs (Print)  
In the last section we investigate perfect deletion-correcting codes containing few codewords.  ...  The first construction uses perfect deletion-correcting codes without repetition of letters to construct other perfect deletion-correcting codes.  ...  Codes with few codewords If tv ≤ k, then the code that contains only the codeword (1, 2, . . . , v, 1, 2, . . . , v, 1, 2, . . . ) is a perfect deletion-correcting code with parameters t, k, v, since  ... 
doi:10.1002/jcd.10069 fatcat:aul2ig73dvf7bitvpnw5zsf234

Lensless Optical Encryption of Multilevel Digital Data Containers Using Spatially Incoherent Illumination

Pavel Cheremkhin, Nikolay Evtikhiev, Vitaly Krasnov, Ilya Ryabcev, Anna Shifrina, Rostislav Starikov
2021 Applied Sciences  
The necessity of the correction of errors emerging during the optical encryption process led to the extensive use of data containers such as QR codes.  ...  The results of optical experiments demonstrate efficient error correction capabilities of the new data container.  ...  Data Containers for an Optical Encryption QR Code as a Data Container To the best of our knowledge, the only full-fledged data container, commonly used in an optical encryption, is QR code.  ... 
doi:10.3390/app12010406 fatcat:lgx63fvoyzbefmxdetaspe5h24

AixBench: A Code Generation Benchmark Dataset [article]

Yiyang Hao
2022 arXiv   pre-print
We also present a new metric for automatically evaluating the correctness of the generated code, and a set of criteria to manually evaluating the overall quality of the generated code.  ...  The benchmark contains a dataset of 175 samples for automated evaluation and a dataset of 161 samples for manual evaluation.  ...  Datasets AixBench contains two datasets: Automated Test Dataset for mostly-automated code correctness evaluation and NL Task Description Dataset for manual code quality evaluation.  ... 
arXiv:2206.13179v2 fatcat:tsvt2c23o5b3fgirptd576v6gi

Quantum error-correcting codes: the unit-derived strategy [article]

Ted Hurley, Donny Hurley, Barry Hurley
2018 arXiv   pre-print
For a given rate and given error-correction capability, quantum error-correcting codes with these specifications are constructed. The codes are explicit with efficient decoding algorithms.  ...  Series of maximum distance quantum error-correcting codes are developed and analysed.  ...  Thus construct a [96, 90, 7] dual-containing code from which the [[96, 84, 7]] quantum code is constructed by the CSS construction. 8 quantum code which can correct 3 errors, that is, construct a [[n,  ... 
arXiv:1805.09053v2 fatcat:nvag6ek7o5fcpcflow5ighknne

Covert QR Codes: How to Hide in the Crowd [chapter]

Yang-Wai Chow, Willy Susilo, Joonsang Baek
2017 Lecture Notes in Computer Science  
The proposed approach employs visual subterfuge to conceal secret information within a QR code. Using a QR code reader, any individual can decode the public information contained in the QR code.  ...  We call this a Covert QR (CQR) code scheme. To embed the secret information, this approach exploits the error correction mechanism inherent in the QR code structure.  ...  The secret QR code that contains a secret message is shown in Fig. 5(a) . It is a QR code of version 2 and error correction level H.  ... 
doi:10.1007/978-3-319-72359-4_42 fatcat:fabwzzkyrbdfdplpe4bd74gqse

Block synchronization for quantum information

Yuichiro Fujiwara
2013 Physical Review A. Atomic, Molecular, and Optical Physics  
A family of quantum codes that are simultaneously synchronizable and error-correcting is given through this approach.  ...  The method also protects qubits from decoherence in a manner similar to conventional quantum error-correcting codes, seamlessly achieving synchronization recovery and error correction.  ...  that are not dual-containing and the quantum error-correcting codes from additive codes over F 4 found in [27] .  ... 
doi:10.1103/physreva.87.022344 fatcat:jy7545rllvdllmeylz7s6gnrtu

Exploiting the Error Correction Mechanism in QR Codes for Secret Sharing [chapter]

Yang-Wai Chow, Willy Susilo, Guomin Yang, James G. Phillips, Ilung Pranata, Ari Moesriami Barmawi
2016 Lecture Notes in Computer Science  
The secret message can be recovered by combining the information contained in the QR code shares.  ...  The secret message can be recovered by combining the information contained in the QR code shares.  ...  Version information is only contained in QR code version 7 and above. It consists of an 18-bit sequence consisting of 6 data bits and 12 Golay error correction bits.  ... 
doi:10.1007/978-3-319-40253-6_25 fatcat:ykxs5u776ng77lnqby7ns7zlhy

A note on the security of code memo

Ruben Wolf, Markus Schneider
2007 Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology - Mobility '07  
For our attack, we have identified feedback channels in Code Memo that can be exploited for distinguishing correct master passwords from incorrect ones, and thereby, sieving candidates of master passwords  ...  We assume that the intention of the Code Memo designers was to provide an ideal cipher system according to Shannon's classification, i.e., it leaves an adversary with uncertainty w.r.t. the correct decryption  ...  by the user and contain exclusively characters of the same sets as they are contained in the original secret code.  ... 
doi:10.1145/1378063.1378107 dblp:conf/mobility/WolfS07 fatcat:vuntfkxiazdbzfarzudac5ljvm

Page 1346 of AT&T Technical Journal Vol. 36, Issue 6 [page]

1957 AT&T Technical Journal  
In Section VI, a number of techniques are presented for using binary error correction coding schemes for non-binary error correction codes.  ...  Section 6.1 shows how such techniques may be used to obtain non-binarv single error correction codes, and single error correction double error detection codes, for the small error case.  ... 


2000 Computer Mathematics  
It is proved that a subclass of self-dual quantum-error-correcting codes of length n obtained from binary linear codes of length 2n defined by symmetric matrices, contains codes that meet the Gilbert-Varshamov  ...  Theorem 3.3 The class of quantum-error-correcting codes of length n obtained from binary codes from A via Theorem 3.1 contains codes that can correct [(d − 1)/2] errors where d ≥ 0.11n.  ...  We use this relation to show that a class of binary formally self-dual codes defined by symmetric matrices give rise to quantum codes with error-correcting capacity proportional to the code length.  ... 
doi:10.1142/9789812791962_0012 fatcat:othksnmmufej5omk7oyiml7edu

Page 2254 of Mathematical Reviews Vol. , Issue 83e [page]

1983 Mathematical Reviews  
Authors’ summary: “The theory of error correcting codes for random error correction has been developed to correct a given number of errors or less wherever these occur.  ...  whose solutions correspond to a minimum redundancy error-correcting code.  ... 

The Weights in MDS Codes

Martianus Frederic Ezerman, Markus Grassl, Patrick Sole
2011 IEEE Transactions on Information Theory  
Up to some explicit exceptional cases, the MDS codes with parameters given by the MDS conjecture are shown to contain all k weights in the range n-k+1 to n.  ...  The proof uses the covering radius of the dual code  ...  radius, codes over rings, geometric codes), interconnection networks (graph spectra, expanders), vector quantization (lattices), and cryptography (Boolean functions).  ... 
doi:10.1109/tit.2010.2090246 fatcat:g7npnwqhajc2fdxvjxnfcsfcpi

Sparse-Graph Codes for Quantum Error Correction

D.J.C. MacKay, G. Mitchison, P.L. McFadden
2004 IEEE Transactions on Information Theory  
We present sparse graph codes appropriate for use in quantum error-correction. Quantum error-correcting codes based on sparse graphs are of interest for three reasons.  ...  We believe some of the codes we present are unsurpassed by previously published quantum error-correcting codes.  ...  And since almost all low-density parity-check codes are good codes, low-density parity-check codes are not expected to contain their duals. This point of view is indeed correct.  ... 
doi:10.1109/tit.2004.834737 fatcat:jnbzqf7nsfbapiy27gsgafqalq
« Previous Showing results 1 — 15 out of 1,782,123 results