Some Explicit Bases Of Riemann-Roch Spaces For Algebraic Geometry Codes

dc.contributor.author	Tan, Yean Nee
dc.date.accessioned	2019-08-28T08:28:57Z
dc.date.available	2019-08-28T08:28:57Z
dc.date.issued	2011
dc.description.abstract	According to Shannon’s Channel Coding Theorem, a code should have long length so that the probability of errors occurring, during the transmission of codewords through a channel, approaches zero. Hence, a good linear code should have long length, large dimension and large minimum distance. The main problem in coding theory is to find optimal linear codes having the largest value of dimension for a given value of length and minimum distance. This problem is equivalent to the problem of finding the largest possible value of information rate for a given value of relative minimum distance. A lower bound on information rate named Tsfasman-Vladut-Zink bound has been found in year 1982 using sequences of algebraic geometry codes (AG codes). Since then, AG code has become an important family of linear codes.	en_US
dc.identifier.uri	http://hdl.handle.net/123456789/8715
dc.language.iso	en	en_US
dc.publisher	Universiti Sains Malaysia	en_US
dc.subject	Riemann-Roch Spaces	en_US
dc.subject	Algebraic Geometry Codes	en_US
dc.title	Some Explicit Bases Of Riemann-Roch Spaces For Algebraic Geometry Codes	en_US
dc.type	Thesis	en_US

Now showing 1 - 1 of 1