#TITLE_ALTERNATIVE#

#TITLE_ALTERNATIVE#

In Coding Theory, codes were invented to detect and correct errors on noisy communication channels. For this purpose, we usually use encoding and decoding methods. It is known that binary even self dual codes, or even self-dual codes for short, are easier to encode and decode. Moreover, if the minim...

Full description

Saved in:
Bibliographic Details
Main Author: ADY SAPUTRA, SUGARA
Format: Final Project
Language:Indonesia
Online Access:https://digilib.itb.ac.id/gdl/view/14504
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Institut Teknologi Bandung
Language: Indonesia
id id-itb.:14504
spelling id-itb.:145042013-02-22T16:25:55Z#TITLE_ALTERNATIVE# ADY SAPUTRA, SUGARA Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/14504 In Coding Theory, codes were invented to detect and correct errors on noisy communication channels. For this purpose, we usually use encoding and decoding methods. It is known that binary even self dual codes, or even self-dual codes for short, are easier to encode and decode. Moreover, if the minimum distance of an even self-dual code is made as large as possible, this code will detect and correct the most number of error patterns. <br /> <br /> Mallows and Sloane [1], [3] have given the upper bound for the minimum distance of binary even self-dual codes of length n. In this final project we review that bound, equipped with numerical approaches. A table of codes which attain this bound is given for <br /> ???? ? 104. text
institution Institut Teknologi Bandung
building Institut Teknologi Bandung Library
continent Asia
country Indonesia
Indonesia
content_provider Institut Teknologi Bandung
collection Digital ITB
language Indonesia
description In Coding Theory, codes were invented to detect and correct errors on noisy communication channels. For this purpose, we usually use encoding and decoding methods. It is known that binary even self dual codes, or even self-dual codes for short, are easier to encode and decode. Moreover, if the minimum distance of an even self-dual code is made as large as possible, this code will detect and correct the most number of error patterns. <br /> <br /> Mallows and Sloane [1], [3] have given the upper bound for the minimum distance of binary even self-dual codes of length n. In this final project we review that bound, equipped with numerical approaches. A table of codes which attain this bound is given for <br /> ???? ? 104.
format Final Project
author ADY SAPUTRA, SUGARA
spellingShingle ADY SAPUTRA, SUGARA
#TITLE_ALTERNATIVE#
author_facet ADY SAPUTRA, SUGARA
author_sort ADY SAPUTRA, SUGARA
title #TITLE_ALTERNATIVE#
title_short #TITLE_ALTERNATIVE#
title_full #TITLE_ALTERNATIVE#
title_fullStr #TITLE_ALTERNATIVE#
title_full_unstemmed #TITLE_ALTERNATIVE#
title_sort #title_alternative#
url https://digilib.itb.ac.id/gdl/view/14504
_version_ 1820737238999236608

Similar Items