Some Optimal Codes And Their Decoding Algorithms [QA268. T258 2008 f rb].
Dalam teori pengkodan, suatu kod-(n, M, d) atas GF(2) yang baik seharusnya mempunyai n yang kecil untuk tujuan penghantaran mesej yang cepat; siaz M yang besar supaya dapat memancar lebih banyak mesej yang berlainan dan d yang besar supaya dapat membetulkan lebih banyak ralat. In coding theory,...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | en |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://eprints.usm.my/10330/1/SOME_OPTIMAL_CODES.pdf http://eprints.usm.my/10330/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1834437223464828928 |
|---|---|
| author | Tee, Chee Ching |
| author_facet | Tee, Chee Ching |
| author_sort | Tee, Chee Ching |
| building | Hamzah Sendut Library |
| collection | Institutional Repository |
| content_provider | Universiti Sains Malaysia |
| content_source | USM Institutional Repository |
| continent | Asia |
| country | Malaysia |
| description | Dalam teori pengkodan, suatu kod-(n, M, d) atas GF(2) yang baik seharusnya mempunyai n yang kecil untuk tujuan penghantaran mesej yang cepat; siaz M yang besar supaya dapat memancar lebih banyak mesej yang berlainan
dan d yang besar supaya dapat membetulkan lebih banyak ralat.
In coding theory, a good (n, M, d) - code over GF(2), should have small n for fast transmission of messages; large M to enable transmission of a wide variety of messages and large d to correct more errors.
|
| format | Thesis |
| id | my.usm.eprints.10330 |
| institution | Universiti Sains Malaysia |
| language | en |
| publishDate | 2008 |
| record_format | eprints |
| spelling | my.usm.eprints.10330 http://eprints.usm.my/10330/ Some Optimal Codes And Their Decoding Algorithms [QA268. T258 2008 f rb]. Tee, Chee Ching QA150-272.5 Algebra Dalam teori pengkodan, suatu kod-(n, M, d) atas GF(2) yang baik seharusnya mempunyai n yang kecil untuk tujuan penghantaran mesej yang cepat; siaz M yang besar supaya dapat memancar lebih banyak mesej yang berlainan dan d yang besar supaya dapat membetulkan lebih banyak ralat. In coding theory, a good (n, M, d) - code over GF(2), should have small n for fast transmission of messages; large M to enable transmission of a wide variety of messages and large d to correct more errors. 2008-03 Thesis NonPeerReviewed application/pdf en http://eprints.usm.my/10330/1/SOME_OPTIMAL_CODES.pdf Tee, Chee Ching (2008) Some Optimal Codes And Their Decoding Algorithms [QA268. T258 2008 f rb]. Masters thesis, Universiti Sains Malaysia. |
| spellingShingle | QA150-272.5 Algebra Tee, Chee Ching Some Optimal Codes And Their Decoding Algorithms [QA268. T258 2008 f rb]. |
| title | Some Optimal Codes And Their Decoding Algorithms
[QA268. T258 2008 f rb]. |
| title_full | Some Optimal Codes And Their Decoding Algorithms
[QA268. T258 2008 f rb]. |
| title_fullStr | Some Optimal Codes And Their Decoding Algorithms
[QA268. T258 2008 f rb]. |
| title_full_unstemmed | Some Optimal Codes And Their Decoding Algorithms
[QA268. T258 2008 f rb]. |
| title_short | Some Optimal Codes And Their Decoding Algorithms
[QA268. T258 2008 f rb]. |
| title_sort | some optimal codes and their decoding algorithms
[qa268. t258 2008 f rb]. |
| topic | QA150-272.5 Algebra |
| url | http://eprints.usm.my/10330/1/SOME_OPTIMAL_CODES.pdf http://eprints.usm.my/10330/ |
| url_provider | http://eprints.usm.my/ |