{"created":"2023-05-15T12:35:37.022499+00:00","id":4596,"links":{},"metadata":{"_buckets":{"deposit":"17e0bec5-46ad-4ead-9ae0-a73574719a5d"},"_deposit":{"created_by":91,"id":"4596","owners":[91],"pid":{"revision_id":0,"type":"depid","value":"4596"},"status":"published"},"_oai":{"id":"oai:nitech.repo.nii.ac.jp:00004596","sets":["31"]},"author_link":["8695","8695","14440","14441"],"item_10001_biblio_info_28":{"attribute_name":"bibliographic_information","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1998-10-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"10","bibliographicPageEnd":"1978","bibliographicPageStart":"1972","bibliographicVolumeNumber":"E81-A","bibliographic_titles":[{"bibliographic_title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences","bibliographic_titleLang":"en"}]}]},"item_10001_description_36":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"In this paper, we present a method for evaluating the minimum free Chernov distance of trellis-codes for a discrete memoryless channels (DMC). In order to design an efficient trellis-code for the DMC, we need to evaluate the minimum free Chernov distance of the target code. However, the lack of the additive property of the Chernov distance prevents a conventional branch-and-bound search for evaluating the minimum distance. To overcome the difficulty, we present a lower bound on the Chernov distance with an additive property. The lower bound plays a key role in the minimum distance evaluation algorithm presented here. By using the proposed algorithm, we have derived the minimum free Chernov distance of some binary linear convolutional codes over Z-channel.","subitem_description_language":"en","subitem_description_type":"Other"}]},"item_10001_full_name_27":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"8695","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"1000020275374","nameIdentifierScheme":"NRID","nameIdentifierURI":"http://rns.nii.ac.jp/nr/1000020275374"}],"names":[{"name":"和田山, 正"}]}]},"item_10001_publisher_29":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Institute of Electronics, Information and Communication Engineers","subitem_publisher_language":"en"}]},"item_10001_source_id_30":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0916-8508","subitem_source_identifier_type":"ISSN"}]},"item_10001_source_id_32":{"attribute_name":"item_10001_source_id_32","attribute_value_mlt":[{"subitem_source_identifier":"AA10826239","subitem_source_identifier_type":"NCID"}]},"item_10001_version_type_33":{"attribute_name":"出版タイプ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Wadayama, Tadashi","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"8695","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"1000020275374","nameIdentifierScheme":"NRID","nameIdentifierURI":"http://rns.nii.ac.jp/nr/1000020275374"}]},{"creatorNames":[{"creatorName":"Wakasugi, Koichiro","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"14440","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Kasahara, Masao","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"14441","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-01-23"}],"displaytype":"detail","filename":"E81-A_1972.pdf","filesize":[{"value":"557.6 kB"}],"format":"application/pdf","license_note":"Copyright(c)1998 IEICE　http://search.ieice.org/index.html","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"本文_fulltext","url":"https://nitech.repo.nii.ac.jp/record/4596/files/E81-A_1972.pdf"},"version_id":"9ed5bb35-4e52-4a41-827b-3e0a4265b13d"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"item_resource_type","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"A Method for Evaluating Minimum Free Chernov Distance of Trellis-Codes for Discrete Memoryless Channel","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Method for Evaluating Minimum Free Chernov Distance of Trellis-Codes for Discrete Memoryless Channel","subitem_title_language":"en"}]},"item_type_id":"10001","owner":"91","path":["31"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2013-06-25"},"publish_date":"2013-06-25","publish_status":"0","recid":"4596","relation_version_is_last":true,"title":["A Method for Evaluating Minimum Free Chernov Distance of Trellis-Codes for Discrete Memoryless Channel"],"weko_creator_id":"91","weko_shared_id":-1},"updated":"2025-03-14T05:52:34.958768+00:00"}