No label defined (Q4023100)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 107496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 107496 |
Statements
23 January 1993
0 references
algebraic-geometric codes
0 references
asymptotically good binary codes
0 references
decoding algorithm
0 references
concatenated codes
0 references
0.87766033411026
0 references
0.8692863583564758
0 references
0.8666620254516602
0 references
This thesis presents an introduction to the theory of algebraic-geometric codes and the new results of the author's research in this theme. The author and his co-authors examined the following problems: --- Can we handle all linear codes by algebraic geometry? --- Can we give an explicit construction with far less complexity of asymptotically good binary codes meeting a good bound? --- How to give an efficient encoding and decoding algorithm for algebraic-geometric codes? In Chapter 2 they showed that all linear codes can be described as algebraic-geometric codes. To explain this conclusion they first make a distinction among all algebraic-geometric codes to weakly algebraic- geometric, algebraic-geometric and strongly algebraic-geometric. In Chapter 3 they gave an answer for the second question by constructing a sequence of asymptotically good binary concatenated codes using curves. Finally, the last three chapters of this thesis are devoted to solving the third problem. The reviewer would like to remark that this work is very good written --- not only because of its style --- but also in point of view of mathematics.
0 references