{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/60166"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/60166","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"The design of binary shaping filter of binary code","abstract":"In information theory, in order to maximize the total throughput, it is required that the codebook has an empirical distribution that maximizes the mutual information over the channel. In coding theory, however, most codes we can generate have Bernoulli (1/2) distribution. In this thesis, we present a new coding scheme to efficiently generate binary codes with different distributions. Our main approach is to first encode the information bits by a linear code C, and then quantized the codeword to the closest codeword in another linear code C,. The quantization error is then treated as the encoded codeword in our coding scheme. We discuss the practicality and advantage of such codes and give a design example.","abstract_html":"In information theory, in order to maximize the total throughput, it is required that the codebook has an empirical distribution that maximizes the mutual information over the channel. In coding theory, however, most codes we can generate have Bernoulli (1/2) distribution. In this thesis, we present a new coding scheme to efficiently generate binary codes with different distributions. Our main approach is to first encode the information bits by a linear code C, and then quantized the codeword to the closest codeword in another linear code C,. The quantization error is then treated as the encoded codeword in our coding scheme. We discuss the practicality and advantage of such codes and give a design example.","abstract_has_math":false,"creators":["Huang, Shao-Lun, Ph. D. Massachusetts Institute of Technology"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Lizhong Zheng."],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010","date_published":"2010","updated_at":"2026-07-22T22:21:23Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/60166","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Lizhong Zheng."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Huang, Shao-Lun, Ph. D. Massachusetts Institute of Technology"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2010-12-06T17:32:22Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2010-12-06T17:32:22Z"]},{"key":"dc:date.issued","label":"Date","values":["2010"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/60166"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.","Includes bibliographical references (p. 35)."]},{"key":"dc:description.abstract","label":"Abstract","values":["In information theory, in order to maximize the total throughput, it is required that the codebook has an empirical distribution that maximizes the mutual information over the channel. In coding theory, however, most codes we can generate have Bernoulli (1/2) distribution. In this thesis, we present a new coding scheme to efficiently generate binary codes with different distributions. Our main approach is to first encode the information bits by a linear code C, and then quantized the codeword to the closest codeword in another linear code C,. The quantization error is then treated as the encoded codeword in our coding scheme. We discuss the practicality and advantage of such codes and give a design example."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:title","label":"Title","values":["The design of binary shaping filter of binary code"]}]}],"canonical_facts":{"dc:contributor.advisor":["Lizhong Zheng."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Huang, Shao-Lun, Ph. D. Massachusetts Institute of Technology"],"dc:date.accessioned":["2010-12-06T17:32:22Z"],"dc:date.available":["2010-12-06T17:32:22Z"],"dc:date.issued":["2010"],"dc:description":["Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.","Includes bibliographical references (p. 35)."],"dc:description.abstract":["In information theory, in order to maximize the total throughput, it is required that the codebook has an empirical distribution that maximizes the mutual information over the channel. In coding theory, however, most codes we can generate have Bernoulli (1/2) distribution. In this thesis, we present a new coding scheme to efficiently generate binary codes with different distributions. Our main approach is to first encode the information bits by a linear code C, and then quantized the codeword to the closest codeword in another linear code C,. The quantization error is then treated as the encoded codeword in our coding scheme. We discuss the practicality and advantage of such codes and give a design example."],"dc:description.degree":["S.M."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/60166"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["The design of binary shaping filter of binary code"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:23Z"}