1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
|
<?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" />
</head>
<body>
<div class="chlinktop"><span class="chlink1">Goto Chapter: </span><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="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>
<div class="chlinkprevnexttop"> <a href="chap0.html">Top of Book</a> <a href="chap7.html">Previous Chapter</a> <a href="chapInd.html">Next Chapter</a> </div>
<p><a id="X7A6F98FD85F02BFE" name="X7A6F98FD85F02BFE"></a></p>
<h3>References</h3>
<p><a id="biBAlltop84" name="biBAlltop84"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">All84</span>] <b class='Bib_author'>Alltop, W. O.</b> <i class='Bib_title'>A method for extending binary linear codes</i>,
<span class='Bib_journal'>IEEE Trans. Inform. Theory</span>,
<em class='Bib_volume'>30</em>,
(<span class='Bib_year'>1984)</span>,
<span class='Bib_pages'>p. 871--872</span></p>
<p><a id="biBBM03" name="biBBM03"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">BMd)</span>] <b class='Bib_author'>Bazzi, L. and Mitter, S. K.</b> <i class='Bib_title'>Some constructions of codes from group actions</i>,
<span class='Bib_journal'>preprint</span>,
(<span class='Bib_year'>March 2003 (submitted))</span></p>
<p><a id="biBBr" name="biBBr"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">Bro06</span>] <b class='Bib_author'>Brouwer, A. E.</b> <i class='Bib_title'>Bounds on the minimum distance of linear codes</i>,
<span class='Bib_publisher'>On the internet at the URL:
http$://$www.win.tue.nl$/\tilde$aeb$/$voorlincod.html</span>,
(<span class='Bib_year'>1997-2006)</span></p>
<p><a id="biBBrouwer98" name="biBBrouwer98"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">Bro98</span>] <b class='Bib_author'>Brouwer, A. E.</b> (<span class='Bib_editor'>Pless, V. S. and Huffman, W. C.</span>, Ed.)<i class='Bib_title'>Bounds on the Size of Linear Codes</i> in ,
<i class='Bib_booktitle'>Handbook of Coding Theory</i>,
<span class='Bib_publisher'>{Elsevier, North Holland}</span>,
(<span class='Bib_year'>1998)</span>,
<span class='Bib_pages'>p. 295--461</span></p>
<p><a id="biBChen69" name="biBChen69"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">Che69</span>] <b class='Bib_author'>Chen, C. L.</b> <i class='Bib_title'>Some Results on Algebraically Structured Error-Correcting
Codes</i>,
<span class='Bib_school'>{University of Hawaii}</span>,
<span class='Bib_address'>USA</span>,
(<span class='Bib_year'>1969)</span></p>
<p><a id="biBGDT91" name="biBGDT91"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">GDT91</span>] <b class='Bib_author'>Gabidulin, E., Davydov, A. and Tombak, L.</b> <i class='Bib_title'>Linear codes with covering radius 2 and other new covering
codes</i>,
<span class='Bib_journal'>IEEE Trans. Inform. Theory</span>,
<em class='Bib_volume'>37</em> (<span class='Bib_number'>1)</span>,
(<span class='Bib_year'>1991)</span>,
<span class='Bib_pages'>p. 219--224</span></p>
<p><a id="biBGallager.1962" name="biBGallager.1962"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">Gal62</span>] <b class='Bib_author'>Gallager, R.</b> <i class='Bib_title'>Low-Density Parity-Check Codes</i>,
<span class='Bib_journal'>IRE Trans. Inform. Theory</span>,
<em class='Bib_volume'>IT-8</em>,
(<span class='Bib_year'>1962)</span>,
<span class='Bib_pages'>p. 21--28</span></p>
<p><a id="biBGao03" name="biBGao03"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">Gao03</span>] <b class='Bib_author'>Gao, S.</b> <i class='Bib_title'>A new algorithm for decoding Reed-Solomon codes</i>,
<span class='Bib_journal'>Communications, Information and Network Security
(V. Bhargava, H. V. Poor, V. Tarokh and S. Yoon, Eds.)</span>,
<span class='Bib_publisher'>Kluwer Academic Publishers</span>,
(<span class='Bib_year'>2003)</span>,
<span class='Bib_pages'>p. pp. 55-68</span></p>
<p><a id="biBGS85" name="biBGS85"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">GS85</span>] <b class='Bib_author'>Graham, R. and Sloane, N.</b> <i class='Bib_title'>On the covering radius of codes</i>,
<span class='Bib_journal'>IEEE Trans. Inform. Theory</span>,
<em class='Bib_volume'>31</em> (<span class='Bib_number'>1)</span>,
(<span class='Bib_year'>1985)</span>,
<span class='Bib_pages'>p. 385--401</span></p>
<p><a id="biBHan99" name="biBHan99"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">Han99</span>] <b class='Bib_author'>Hansen, J. P.</b> <i class='Bib_title'>Toric surfaces and error-correcting codes</i>,
<span class='Bib_journal'>Coding theory, cryptography, and related areas
(ed., Bachmann et al) Springer-Verlag</span>,
(<span class='Bib_year'>1999)</span></p>
<p><a id="biBHHKK07" name="biBHHKK07"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">HHKK07</span>] <b class='Bib_author'>Harada, M., Holzmann, W., Kharaghani, H. and Khorvash, M.</b> <i class='Bib_title'>Extremal Ternary Self-Dual Codes Constructed from Negacirculant
Matrices</i>,
<span class='Bib_journal'>Graphs and Combinatorics</span>,
<em class='Bib_volume'>23</em> (<span class='Bib_number'>4)</span>,
(<span class='Bib_year'>2007)</span>,
<span class='Bib_pages'>p. 401--417</span></p>
<p><a id="biBHe72" name="biBHe72"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">Hel72</span>] <b class='Bib_author'>Helgert, H. J.</b> <i class='Bib_title'>Srivastava codes</i>,
<span class='Bib_journal'>IEEE Trans. Inform. Theory</span>,
<em class='Bib_volume'>18</em>,
(<span class='Bib_year'>1972)</span>,
<span class='Bib_pages'>p. 292--297</span></p>
<p><a id="biBHP03" name="biBHP03"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">HP03</span>] <b class='Bib_author'>Huffman, W. C. and Pless, V.</b> <i class='Bib_title'>Fundamentals of error-correcting codes</i>,
<span class='Bib_publisher'>Cambridge Univ. Press</span>,
(<span class='Bib_year'>2003)</span></p>
<p><a id="biBJo04" name="biBJo04"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">Joy04</span>] <b class='Bib_author'>Joyner, D.</b> <i class='Bib_title'>Toric codes over finite fields</i>,
<span class='Bib_journal'>Applicable Algebra in Engineering,
Communication and Computing</span>,
<em class='Bib_volume'>15</em>,
(<span class='Bib_year'>2004)</span>,
<span class='Bib_pages'>p. 63--79</span></p>
<p><a id="biBJH04" name="biBJH04"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">JH04</span>] <b class='Bib_author'>Justesen, J. and Hoholdt, T.</b> <i class='Bib_title'>A course in error-correcting codes</i>,
<span class='Bib_publisher'>European Mathematical Society</span>,
(<span class='Bib_year'>2004)</span></p>
<p><a id="biBLeon88" name="biBLeon88"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">Leo88</span>] <b class='Bib_author'>Leon, J. S.</b> <i class='Bib_title'>A probabilistic algorithm for computing minimum weights of
large error-correcting codes</i>,
<span class='Bib_journal'>IEEE Trans. Inform. Theory</span>,
<em class='Bib_volume'>34</em>,
(<span class='Bib_year'>1988)</span>,
<span class='Bib_pages'>p. 1354--1359</span></p>
<p><a id="biBLeon82" name="biBLeon82"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">Leo82</span>] <b class='Bib_author'>Leon, J. S.</b> <i class='Bib_title'>Computing automorphism groups of error-correcting codes</i>,
<span class='Bib_journal'>IEEE Trans. Inform. Theory</span>,
<em class='Bib_volume'>28</em>,
(<span class='Bib_year'>1982)</span>,
<span class='Bib_pages'>p. 496--511</span></p>
<p><a id="biBLeon91" name="biBLeon91"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">Leo91</span>] <b class='Bib_author'>Leon, J. S.</b> <i class='Bib_title'>Permutation group algorithms based on partitions, I: theory
and algorithms</i>,
<span class='Bib_journal'>J. Symbolic Comput.</span>,
<em class='Bib_volume'>12</em>,
(<span class='Bib_year'>1991)</span>,
<span class='Bib_pages'>p. 533--583</span></p>
<p><a id="biBMS83" name="biBMS83"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">MS83</span>] <b class='Bib_author'>MacWilliams, F. J. and Sloane, N. J. A.</b> <i class='Bib_title'>The theory of error-correcting codes</i>,
<span class='Bib_publisher'>Amsterdam: North-Holland</span>,
(<span class='Bib_year'>1983)</span></p>
<p><a id="biBTSSFC04" name="biBTSSFC04"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">S}04</span>] <b class='Bib_author'>R. Tanner D. Sridhara A. Sridharan, T. F. and }, D. C.</b> <i class='Bib_title'>LDPC Block and Convolutional Codes Based on Circulant
Matrices</i>,
<span class='Bib_journal'>STRING-NOT-KNOWN: ieee_j_it</span>,
<em class='Bib_volume'>50</em> (<span class='Bib_number'>12)</span>,
(<span class='Bib_year'>2004)</span>,
<span class='Bib_pages'>p. 2966--2984</span></p>
<p><a id="biBSloane72" name="biBSloane72"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">SRC72</span>] <b class='Bib_author'>Sloane, N., Reddy, S. and Chen, C.</b> <i class='Bib_title'>New binary codes</i>,
<span class='Bib_journal'>IEEE Trans. Inform. Theory</span>,
<em class='Bib_volume'>18</em>,
(<span class='Bib_year'>1972)</span>,
<span class='Bib_pages'>p. 503--510</span></p>
<p><a id="biBSt93" name="biBSt93"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">Sti93</span>] <b class='Bib_author'>Stichtenoth, H.</b> <i class='Bib_title'>Algebraic function fields and codes</i>,
<span class='Bib_publisher'>Springer-Verlag</span>,
(<span class='Bib_year'>1993)</span></p>
<p><a id="biBGG03" name="biBGG03"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">GG03</span>] <b class='Bib_author'>von zur Gathen, J. and J. Gerhard,</b> <i class='Bib_title'>Modern computer algebra</i>,
<span class='Bib_publisher'>Cambridge Univ. Press</span>,
(<span class='Bib_year'>2003)</span></p>
<p><a id="biBZimmermann96" name="biBZimmermann96"></a></p>
<p class='Bib_entry'>
[<span class='Bib_key' style="color: #8e0000;">Zim96</span>] <b class='Bib_author'>Zimmermann, K. -.H.</b> <i class='Bib_title'>Integral Hecke Modules, Integral Generalized Reed-Muller
Codes, and Linear Codes</i> (<span class='Bib_number'>3--96)</span>,
<span class='Bib_address'>Hamburg, Germany</span>,
(<span class='Bib_year'>1996)</span></p>
<p> </p>
<div class="chlinkprevnextbot"> <a href="chap0.html">Top of Book</a> <a href="chap7.html">Previous Chapter</a> <a href="chapInd.html">Next Chapter</a> </div>
<div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><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="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>
<hr />
<p class="foot">generated by <a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
</body>
</html>
|
