Abstract
We describe a software tool called CQUest which has been designed for the generation and manipulation of code tables. CQUest handles one code table for each alphabet. It supports two kinds of operations for the manipulation of code tables: code modifications and code combinations. CQUest provides an interpreter for interactive use. Some new good quaternary codes obtained by CQUest are described.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berlekamp E., McEliece R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory, IT-24 (1978) 384–386.
Betten A., Kerber A., Fripertinger H., Wassermann A., Zimmermann, K.-H.: Codierungstheorie — Konstruktion und Anwendung linearer Codes. Springer, Berlin (1998)
Brouwer, A.: http:// www.win.tue.nl/math/dw/personalpages/aeb/voorlincod.html
Dipper R., James G.: Representations of Hecke algebras of general linear groups. J. Algebra (1986) 20–52.
Dipper R., James G., Murphy E.: Hecke algebras of type Bn at roots of unity. Preprint (1985)Thomas Rehfinger, N. Suresh Babu, and Karl-Heinz Zimmermann.
A. Geist et al.: PVM: Parallel Virtual Machine. A Users Guide and Tutorial for Networked Parallel Computing. MIT Press, 1994; http://www.netlib.org/pvm3/book/pvm-book.html
Greenough P.P., Hill FL: Optimal linear codes over GF(4). Discrete Math. 125 (1994) 187–199.
Groneick, B., Grosse, S.: Konstruktion binärer Codes. Diploma Thesis, Univ. Münster (1991).
Heigert H.J., Stinaff, R.D.: Minimum-distance bounds for binary linear codes. IEEE Trans. Inform. Theory, IT-19 (1973) 344–356.
James G., Kerber, A.: The Representation Theory of the Symmetric Group. Addison Wesley Pub., Reading, MA (1981).
Mac Williams J., Sloane, N: The Theory of Error Correcting Codes. North- Holland, Amsterdam (1988).
Rehfinger, T.: Verteilte Suche nach guten linearen Codes. Diploma Thesis, TU Hamburg-Harburg (to appear).
Schönert M. et. al.: GAP - Groups, Algorithms, and Programming. Lehrstuhl D für Mathematik, RWTH Aachen, 5th Ed. (1995).
Suresh Babu, N., Zimmermann, K.-H.: Testing the equivalence of linear codes over finite local commutative rings, submitted (1999).
Verhoeff, T.: An updated table of minimum-distance bounds for binary linear codes. IEEE Trans. Inform. Theory, IT-33 (1987) 665–680.
Wirtz, M.: Konstruktion und Tabellen linearer Codes. Ph.D. Thesis, Univ. Münster (1991).
Zimmermann, K.-H.: Beiträge zur algebraischen Codierungstheorie mittels modularer Darstellungstheorie. Bayreuther Math. Schriften, Bayreuth 48 (1994).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rehfinger, T., Babu, N.S., Zimmermann, KH. (2001). New Good Codes via CQuest — A System for the Silicon Search of Linear Codes. In: Betten, A., Kohnert, A., Laue, R., Wassermann, A. (eds) Algebraic Combinatorics and Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59448-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-59448-9_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41110-9
Online ISBN: 978-3-642-59448-9
eBook Packages: Springer Book Archive