Markus Grassl
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Markus Grassl has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Ilya Dumer
University of California
2 shared publications - Leonid P. Pryadko
Department of Physics & Astronomy University of California Riverside USA
2 shared publications - Rainer Steinwandt
Florida Atlantic University
2 shared publications - Yunfan Li
Centre for Quantum Technologies National University of Singapore 117543 Singapore Singapore
2 shared publications - Barry C. Sanders
Institute for Quantum Science and Technology, University of Calgary, Calgary, Canada
1 shared publication Bei Zeng
1 shared publication
Latest Publications
- Open Access
New Constructions of Codes for Asymmetric Channels via Concatenation
We present new constructions of codes for asymmetric channels for both binary and nonbinary alphabets, based on methods of generalized code concatenation. For the binary asymmetric channel, our methods construct nonlinear single-error-correcting codes from ternary outer codes. We show that some of the Varshamov-Tenengol'ts-Constantin-Rao codes, a class of binary nonlinear codes for this channel, have a nice structure when viewed as ternary codes. In many cases, our ternary construction yields even better codes. For the nonbinary asymmetric channel, our methods construct linear codes for many lengths and distances which are superior to the linear codes of the same length capable of correcting the same number of symmetric errors. In the binary case, Varshamov has shown that almost all good linear codes for the asymmetric channel are also good for the symmetric channel. Our results indicate that Varshamov's argument does not extend to the nonbinary case, i.e., one can find better linear codes for asymmetric channels than for symmetric ones.
Open AccessNew Constructions of Codes for Asymmetric Channels via Concatenation
We present new constructions of codes for asymmetric channels for both binary and nonbinary alphabets, based on methods of generalized code concatenation. For the binary asymmetric channel, our methods construct nonlinear single-error-correcting codes from ternary outer codes. We show that some of the Varshamov-Tenengol'ts-Constantin-Rao codes, a class of binary nonlinear codes for this channel, have a nice structure when viewed as ternary codes. In many cases, our ternary construction yields even better codes. For the nonbinary asymmetric channel, our methods construct linear codes for many lengths and distances which are superior to the linear codes of the same length capable of correcting the same number of symmetric errors. In the binary case, Varshamov has shown that almost all good linear codes for the asymmetric channel are also good for the symmetric channel. Our results indicate that Varshamov's argument does not extend to the nonbinary case, i.e., one can find better linear codes for asymmetric channels than for symmetric ones.
- Open Access
Stabilizer formalism for generalized concatenated quantum codes
The concept of generalized concatenated quantum codes (GCQC) provides a systematic way for constructing good quantum codes from short component codes. We introduce a stabilizer formalism for GCQCs, which is achieved by defining quantum coset codes. This formalism offers a new perspective for GCQCs and enables us to derive a lower bound on the code distance of stabilizer GCQCs from component codes parameters,for both non-degenerate and degenerate component codes. Our formalism also shows how to exploit the error-correcting capacity of component codes to design good GCQCs efficiently.
Open AccessStabilizer formalism for generalized concatenated quantum codes
The concept of generalized concatenated quantum codes (GCQC) provides a systematic way for constructing good quantum codes from short component codes. We introduce a stabilizer formalism for GCQCs, which is achieved by defining quantum coset codes. This formalism offers a new perspective for GCQCs and enables us to derive a lower bound on the code distance of stabilizer GCQCs from component codes parameters,for both non-degenerate and degenerate component codes. Our formalism also shows how to exploit the error-correcting capacity of component codes to design good GCQCs efficiently.
- 28 June 2012
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 70 (1-2) , 149-156
New binary codes from extended Goppa codes
- 28 June 2012
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 70 (1-2) , 149-156
New binary codes from extended Goppa codes
- Open Access
The Weights in MDS Codes
The weights in MDS codes of length n and dimension k over the finite field GF(q) are studied. 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
Open AccessThe Weights in MDS Codes
The weights in MDS codes of length n and dimension k over the finite field GF(q) are studied. 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
- 26 May 2010
- Published by American Physical Society (APS) in Physical Review A
- Vol. 81 (5)
Structured error recovery for code-word-stabilized quantum codes
Code-word-stabilized (CWS) codes are, in general, nonadditive quantum codes that can correct errors by an exhaustive search of different error patterns, similar to the way that we decode classical nonlinear codes. For an n-qubit quantum code correcting errors on up to t qubits, this brute-force approach consecutively tests different errors of weight t or less and employs a separate n-qubit measurement in each test. In this article, we suggest an error grouping technique that allows one to simultaneously test large groups of errors in a single measurement. This structured error recovery technique exponentially reduces the number of measurements by about 3t times. While it still leaves exponentially many measurements for a generic CWS code, the technique is equivalent to syndrome-based recovery for the special case of additive CWS codes.
- 26 May 2010
- Published by American Physical Society (APS) in Physical Review A
- Vol. 81 (5)
Structured error recovery for code-word-stabilized quantum codes
Code-word-stabilized (CWS) codes are, in general, nonadditive quantum codes that can correct errors by an exhaustive search of different error patterns, similar to the way that we decode classical nonlinear codes. For an n-qubit quantum code correcting errors on up to t qubits, this brute-force approach consecutively tests different errors of weight t or less and employs a separate n-qubit measurement in each test. In this article, we suggest an error grouping technique that allows one to simultaneously test large groups of errors in a single measurement. This structured error recovery technique exponentially reduces the number of measurements by about 3t times. While it still leaves exponentially many measurements for a generic CWS code, the technique is equivalent to syndrome-based recovery for the special case of additive CWS codes.
- 16 March 2010
- Published by Springer Nature in Journal of Cryptology
- Vol. 24 (1) , 148-156
Cryptanalysis of the Tillich–Zémor Hash Function
- 16 March 2010
- Published by Springer Nature in Journal of Cryptology
- Vol. 24 (1) , 148-156
Cryptanalysis of the Tillich–Zémor Hash Function
- Open Access
Structured Error Recovery for Codeword-Stabilized Quantum Codes
Codeword stabilized (CWS) codes are, in general, non-additive quantum codes that can correct errors by an exhaustive search of different error patterns, similar to the way that we decode classical non-linear codes. For an n-qubit quantum code correcting errors on up to t qubits, this brute-force approach consecutively tests different errors of weight t or less, and employs a separate n-qubit measurement in each test. In this paper, we suggest an error grouping technique that allows to simultaneously test large groups of errors in a single measurement. This structured error recovery technique exponentially reduces the number of measurements by about 3^t times. While it still leaves exponentially many measurements for a generic CWS code, the technique is equivalent to syndrome-based recovery for the special case of additive CWS codes.
Open AccessStructured Error Recovery for Codeword-Stabilized Quantum Codes
Codeword stabilized (CWS) codes are, in general, non-additive quantum codes that can correct errors by an exhaustive search of different error patterns, similar to the way that we decode classical non-linear codes. For an n-qubit quantum code correcting errors on up to t qubits, this brute-force approach consecutively tests different errors of weight t or less, and employs a separate n-qubit measurement in each test. In this paper, we suggest an error grouping technique that allows to simultaneously test large groups of errors in a single measurement. This structured error recovery technique exponentially reduces the number of measurements by about 3^t times. While it still leaves exponentially many measurements for a generic CWS code, the technique is equivalent to syndrome-based recovery for the special case of additive CWS codes.
- 16 July 2009
- Published by Elsevier in Information Processing Letters
- Vol. 109 (15) , 861-863
Cryptanalysis of an authentication scheme using truncated polynomials
- 16 July 2009
- Published by Elsevier in Information Processing Letters
- Vol. 109 (15) , 861-863
Cryptanalysis of an authentication scheme using truncated polynomials
- Open Access
Generalized Concatenation for Quantum Codes
We show how good quantum error-correcting codes can be constructed using generalized concatenation. The inner codes are quantum codes, the outer codes can be linear or nonlinear classical codes. Many new good codes are found, including both stabilizer codes as well as so-called nonadditive codes.
Open AccessGeneralized Concatenation for Quantum Codes
We show how good quantum error-correcting codes can be constructed using generalized concatenation. The inner codes are quantum codes, the outer codes can be linear or nonlinear classical codes. Many new good codes are found, including both stabilizer codes as well as so-called nonadditive codes.