Ziele Untersuchung
mit Columbo Integrität von
Datenbanken Interaktion und
Portierbarkeit Ergonomie der
Schnittstellen

Angebot Produkte Projekt Beratung

Mittel Analytik Modellierung Sprachen Algebra Logik Hardware Denken Kreativität

Zusammenhänge Gesellschaft Wirtschaft Branche Firma

Benutzer


products/Sources/formale Sprachen/GAP/pkg/guava/doc/ (GAP Algebra Version 4.15.1^©) Datei vom 1.1.2025 mit Größe 12 kB

Quellcode-Bibliothek chapBib.html

Sprache: HTML

products/Sources/formale Sprachen/GAP/pkg/guava/doc/chapBib.html

<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
 "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<title>GAP (guava) - References</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chapBib" onload="jscontent()">

<div class="chlinktop">Goto Chapter: <a href="chap0.html">Top</a> <a href="chap1.html">1</a> <a href="chap2.html">2</a> <a href="chap3.html">3</a> <a href="chap4.html">4</a> <a href="chap5.html">5</a> <a href="chap6.html">6</a> <a href="chap7.html">7</a> <a href="chap8.html">8</a> <a href="chap9.html">9</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>

<div class="chlinkprevnexttop"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chap9.html">[Previous Chapter]</a> <a href="chapInd.html">[Next Chapter]</a> </div>

<a href="chapBib_mj.html">[MathJax on]</a>
<a id="X7A6F98FD85F02BFE" name="X7A6F98FD85F02BFE"></a>

<h3>References</h3>

<a id="biBAlltop84" name="biBAlltop84"></a>

[All84] Alltop, W. O.,
A method for extending binary linear codes,
IEEE Trans. Inform. Theory,
30 (6)
(1984),
871-872.


<a id="biBBM03" name="biBBM03"></a>

[BM06] Bazzi, L. and Mitter, S. K.,
Some Randomized Code Constructions From Group Actions,
IEEE Trans. Inform. Theory,
52 (7)
(2006),
3210-3219.


<a id="biBBrouwer98" name="biBBrouwer98"></a>

[Bro98] Brouwer, A. E. (Pless, V. S. and Huffman, W. C., Eds.),
Bounds on the Size of Linear Codes,
 in Handbook of Coding Theory,
Elsevier,
Amsterdam
(1998),
295-461.


<a id="biBBr" name="biBBr"></a>

[Bro06] Brouwer, A. E.,
Bounds on the minimum distance of linear codes
(1997-2006),
<a href="https://www.codetables.de/">https://www.codetables.de/</a>.


<a id="biBChen69" name="biBChen69"></a>

[Che69] Chen, C. L.,
Some Results on Algebraically Structured Error-Correcting
 Codes,
Doctoral Dissertation,
University of Hawaii,
Honolulu, USA
(1969).


<a id="biBGallager.1962" name="biBGallager.1962"></a>

[Gal62] Gallager, R.,
Low-Density Parity-Check Codes,
IRE Trans. Inf. Theor.,
IT-8
(1962),
21-28.


<a id="biBGao03" name="biBGao03"></a>

[Gao03] Gao, S. (Bhargava, V., Poor, H. V., Tarokh, V. and Yoon, S., Eds.),
A New Algorithm for Decoding Reed-Solomon Codes,
 in Communications, Information and Network Security,
Springer,
Boston, MA
(2003),
55-68.


<a id="biBGDT91" name="biBGDT91"></a>

[GDT91] Gabidulin, E., Davydov, A. and Tombak, L.,
Linear codes with covering radius 2 and other new covering
 codes,
IEEE Trans. Inform. Theory,
37 (1)
(1991),
219-224.


<a id="biBGS85" name="biBGS85"></a>

[GS85] Graham, R. and Sloane, N.,
On the Covering Radius of Codes,
IEEE Trans. Inform. Theory,
31 (3)
(1985),
385-401.


<a id="biBHan99" name="biBHan99"></a>

[Han00] Hansen, J. P. (Buchmann, J., Høholdt, T., Stichtenoth, H. and Tapia-Recillas, H., Eds.),
Toric Surfaces and Error-correcting Codes,
 in Coding Theory, Cryptography and Related Areas,
Springer,
Berlin Heidelberg
(2000),
132-142.


<a id="biBHe72" name="biBHe72"></a>

[Hel72] Helgert, H. J.,
Srivastava Codes,
IEEE Trans. Inform. Theory,
18 (2)
(1972),
292-297.


<a id="biBHHKK07" name="biBHHKK07"></a>

[HHKK07] Harada, M., Holzmann, W., Kharaghani, H. and Khorvash, M.,
Extremal Ternary Self-Dual Codes Constructed from Negacirculant
 Matrices,
Graphs Combin.,
23 (4)
(2007),
401-417.


<a id="biBHP03" name="biBHP03"></a>

[HP03] Huffman, W. C. and Pless, V.,
Fundamentals of error-correcting codes,
Cambridge University Press
(2003).


<a id="biBJH04" name="biBJH04"></a>

[JH04] Justesen, J. and Høholdt, T.,
A course in Error-Correcting Codes,
European Mathematical Society,
EMS Textbooks in Mathematics
(2004).


<a id="biBJo04" name="biBJo04"></a>

[Joy04] Joyner, D.,
Toric codes over finite fields,
Appl. Algebra Engrg. Comm. Comput.,
15 (1)
(2004),
63-79.


<a id="biBLeon82" name="biBLeon82"></a>

[Leo82] Leon, J. S.,
Computing automorphism groups of error-correcting codes,
IEEE Trans. Inform. Theory,
28 (3)
(1982),
496-511.


<a id="biBLeon88" name="biBLeon88"></a>

[Leo88] Leon, J. S.,
A probabilistic algorithm for computing minimum weights of large
 error-correcting codes,
IEEE Trans. Inform. Theory,
34 (5)
(1988),
1354-1359.


<a id="biBLeon91" name="biBLeon91"></a>

[Leo91] Leon, J. S.,
Permutation group algorithms based on partitions, I: Theory
 and algorithms,
J. Symbolic Comput.,
12 (4-5)
(1991),
533-583.


<a id="biBMS83" name="biBMS83"></a>

[MS83] MacWilliams, F. J. and Sloane, N. J. A.,
The theory of error-correcting codes,
North-Holland,
North-Holland Mathematical Library,
16,
Amsterdam
(1983).


<a id="biBSloane72" name="biBSloane72"></a>

[SRC72] Sloane, N., Reddy, S. and Chen, C.,
New binary codes,
IEEE Trans. Inform. Theory,
18 (4)
(1972),
503-510.


<a id="biBSt93" name="biBSt93"></a>

[Sti93] Stichtenoth, H.,
Algebraic Function Fields and Codes,
Springer,
Graduate Texts in Mathematics,
254
(1993).


<a id="biBTSSFC04" name="biBTSSFC04"></a>

[TSS+04] Tanner, R., Sridhara, D., Sridharan, A., Fuja, T. and Costello Jr., D.,
LDPC Block and Convolutional Codes Based on Circulant
 Matrices,
IEEE Trans. Inform. Theory,
50 (12)
(2004),
2966-2984.


<a id="biBGG03" name="biBGG03"></a>

[vzGG03] von zur Gathen, J. and Gerhard, J.,
Modern computer algebra,
Cambridge University Press
(2003).


<a id="biBZimmermann96" name="biBZimmermann96"></a>

[Zim96] Zimmermann, K. H.,
Integral Hecke Modules, Integral Generalized
 Reed-Muller Codes, and Linear Codes,
Technische Universität Hamburg-Harburg (3-96),
Hamburg, Germany
(1996).


 

<div class="chlinkprevnextbot"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chap9.html">[Previous Chapter]</a> <a href="chapInd.html">[Next Chapter]</a> </div>

<div class="chlinkbot">Goto Chapter: <a href="chap0.html">Top</a> <a href="chap1.html">1</a> <a href="chap2.html">2</a> <a href="chap3.html">3</a> <a href="chap4.html">4</a> <a href="chap5.html">5</a> <a href="chap6.html">6</a> <a href="chap7.html">7</a> <a href="chap8.html">8</a> <a href="chap9.html">9</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>

<hr />
generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a>
</body>
</html>

Messung V0.5 in Prozent

¤ Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.0.16Bemerkung: (vorverarbeitet am 2026-06-23) ¤

*Bot Zugriff

Wurzel

Die Firma ist wie angegeben erreichbar.

PVS Prover

Isabelle Prover

NIST Cobol Testsuite

Cephes Mathematical Library

Vienna Development Method

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.