KOBAYASHI KINGO
| Emeritus Professor etc. | Emeritus Professor |
Researcher Information
Research Keyword
Educational Background
Member History
- May 2007 - May 2008
基礎境界ソサイエティ次期会長, 電子情報通信学会, Society - 2004 - 2007
Associate Editor on Shannon Theory, IEEE Transactions on Information Theory, The Institute of Electrical and Electronics Engineers,Inc., Society - 2004 - 2005
Member of Award Committee, The Institute of Electrical and Electronics Engineers,Inc., Society - 2004 - 2005
President, Society - 2004 - 2005
会長, 情報理論とその応用学会, Society - 2002 - 2003
監事, 情報理論とその応用学会, Society - 2000 - 2001
Vice President, Society - 2000 - 2001
副会長, 情報理論とその応用学会, Society - 2001
情報理論研究専門委員会顧問, 電子情報通信学会, Society - 2000 - 2000
情報理論研究専門委員会委員長, 電子情報通信学会, Society - 1997 - 2000
英文誌編集委員, 電子情報通信学会, Society - 1998 - 1999
IEEE Information Theory Society, Tokyo Chapter, Chair, The Institute of Electrical and Electronics Engineers,Inc., Society - 1992 - 1993
評議員, 情報理論とその応用学会, Society - 1990 - 1991
企画理事, 情報理論とその応用学会, Society
Research Activity Information
Paper
- A novel steganographic system with information integrity
Youngran Park; Hyunho Kang; Kazuhiko Yamaguchi; Kingo Kobayashi
IEICE ELECTRONICS EXPRESS, IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, 4, 12, 393-399, Jun. 2007, Peer-reviwed, We propose a novel steganographic system that is able to provide a high quality stego image in spite of the high capacity of the concealed information. The number of insertion bits in a pixel is different according to each pixel's characteristics. In addition to that, our system is able to verify whether if the secret information was sent from the sender correctly or if an attacker forged the secret message. We use two frequency coefficients in DCT domain to generate the symbol code to check the integrity of secret information.
Scientific journal, English - Turbo equalization with single-parity check codes and unequal error protection codes
Brian M. Kurkoski; Kazuhiko Yamaguchi; Kingo Kobayashi
IEEE TRANSACTIONS ON MAGNETICS, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 42, 10, 2579-2581, Oct. 2006, Peer-reviwed, The performance of turbo equalization with interleaved single-parity check codes on partial-response channels is evaluated. Single-parity check codes are weak codes, but are shown to have modest performance gain. The proposed system achieves gains of 3.5, 3.4, 2.7, and 2.4 dB with code rates of 19/20, 24/25, 49/50, and 63/64, respectively, at a BER of 10(-5). The complexity of the proposed decoder is significantly lower thin that of turbo equalization using standard low-density parity-check codes. These single-parity check codes are modified to be unequal error protection codes, designed to decrease the probability that Viterbi error events span Reed-Solomon symbol boundaries, resulting in a decrease of the sector error rate. Once such code gains an additional 0.1 dB over a single-parity check code of the same code rate of 24/25.
Scientific journal, English - A Viable System for Tracing Illegal Users of Video
Hyun-Ho Kang; Brian Kurkoski; Young-Ran Park; Hye-Joo Lee; Sang-Uk Shin; Kazuhiko Yamaguchi; Kingo Kobayashi
Lecture Notes in Computer Science, Springer-Verlag, Vol. 3917 (WISI 2006), 156-158, 2006, Peer-reviwed
Scientific journal, English - Tracing Illegal Users of Video : Reconsideration of Tree-Specific and Endbuyer-Specific Methods
Hyunho Kang; Brian Kurkoski; Kazuhiko Yamaguchi; Kingo Kobayashi
Lecture Notes in Computer Science, Springer-Verlag, WICS2006, 2006, Peer-reviwed
Scientific journal, English - Percolation on a k-ary Tree
K. Kobayashi; H. Morita; M. Hoshi
Lecture Notes in Computer Science, Springer-Verlag, 4123, 633-638, 2006, Peer-reviwed
Research society, English - Capacity Problem of Trapdoor Channel
K. Kobayashi
Lecture Notes in Computer Science, Springer-Verlag, 4123, 2006, Peer-reviwed
Research society, English - A further consideration on the HK and the CMG regions for the interference channel
K. Kobayashi; T.S.Han
Proceeding on 2006 Information Theory and Applications Workshop, 18, 2006, Peer-reviwed
International conference proceedings, English - Study on Turbo Decoding Using Hard Decision Decoder―Principle of Hard-in Soft-out Decoding
K. Yamaguchi; S. Maehara; B. Kurkoski; K. Kobayash
Proceedings of 2006 International Symposium on Information Theory and Its Applications (ISITA2006), 114-118, 2006, Peer-reviwed
International conference proceedings, English - Specifying the Subtree Number of a Content Distribution Tree Using Visual Cryptography
H. Kang; B. Kurkoski; K. Yamaguchi; K. Kobayashi
Proceedings of 2006 International Symposium on Information Theory and Its Applications (ISITA2006), 161-165, 2006, Peer-reviwed
International conference proceedings, English - Improvements and Extensions of Low-Rate Turbo-Hadamard Codes
N. Shimanuki; B. Kurkoski; K. Yamaguchi; K. Kobayashi
Proceedings of 2006 International Symposium on Information Theory and Its Applications (ISITA2006), 218-223, 2006, Peer-reviwed
International conference proceedings, English - A Viable System for Tracing Illegal Users of Video
H. Kang; B. Kurkoski; Y. Park; H. Lee; S. Shin; K. Yamaguchi; K. Kobayashi
Proc. of Workshop on Intelligence and Security Informatics, LNCS 3917, 2006, Peer-reviwed
International conference proceedings, English - Video Fingerprinting System using Wavelets and Error Correcting Codes
Hyun-Ho Kang; Brian Kurkoski; Young-Ran Park; Hye-Joo Lee; Sang-Uk Shin; Kazuhiko Yamaguchi; Kingo Kobayashi
Lecture Notes in Computer Science, Springer-Verlag, Vol. 3786, 150-164, 2005, Peer-reviwed
Scientific journal, English - Video Fingerprinting System using Wavelets and Error Correcting Codes
Hyun-Ho Kang; Brian Kurkoski; Young-Ran Park; Hye-Joo Lee; Sang-Uk Shin; Kazuhiko Yamaguchi; Kingo Kobayashi
Proceedings of 6th International Workshop on Information Security Applications 2005 (WISA 2005), 323-338, 2005, Peer-reviwed
International conference proceedings, English - On BCJR state metric quantization for turbo equalization
BM Kurkoski; K Yamaguchi; K Kobayashi
2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, IEEE, 234-238, 2005, Peer-reviwed, Vector quantization of the BCJR and Viterbi algorithms' state metrics for detection of finite-state channels is considered. An estimate is given for the gain associated with vector quantization, over conventional implementations. This is expressed using the volume of the recurrent region, and the maximum state metric difference, which are both intrinsic properties of the channel detector. One application of this gain is the complexity evaluation of a previously proposed lookup-table BCJR implementation. The BCJR algorithm is of interest in turbo equalization used for communication over intersymbol-interference and finite-state Markov channels.
International conference proceedings, English - A Decoding Algorithm for LDPC Codes using Threshold Control for the Burst Error Channe
M. Yabe; K. Yamaguchi; B. Kurkoski; K. Kobayashi
Proceedings of Hawaii, IEICE and SITA Joint Conference on Information Theory, IT2005, 21, 121-124, 2005, Peer-reviwed
International conference proceedings, English - Trees and Tableaux
K.Kobayashi; H.Morita; M.Hoshi
Proceedings of 4rd Asian-European Workshop on Information Theory, 53-54, Oct. 2004
International conference proceedings, English - On Source Conversion using Arithmetic Codes
H.Morita; M.Hoshi; K.Kobayashi
Proceedings of 4rd Asian-European Workshop on Information Theory, 13-15, Oct. 2004
International conference proceedings, English - Some considerations on three dimensional Young tableaux
K.Kobayashi
Conference on General Theory of Information Transfer and Combinatorics, Apr. 2004
International conference proceedings, English - Interval Algorithm, Arithmetic Coding, and Shift Operator
M.Hoshi; H.Morita; K.Kobayashi
Proceedings of 4rd Asian-European Workshop on Information Theory, 39-42, Apr. 2004
International conference proceedings, English - Studies on Bit Serial Sum-Product Decoding Based on Controlling Decoding Order
K. Yamaguchi; Y. Kurihara, M; Yabe; K. Kobayashi
Proceeding on International Symposium on Information Theory and Its Application 2004, 1001-1006, 2004, Peer-reviwed
International conference proceedings, English - Capacity Problem of Trapdoor Channel
K.Kobayashi
Conference on Information Transfer and Combinatorics, Aug. 2003
International conference proceedings, English - A Survey of Multi User Information Theory
K.Kobayashi
Conference on General Theory of Information Transfer and Combinatorics, Aug. 2003
International conference proceedings, English - A Tree Source and its Entropy
K. Kobayashi; H. Morita; M.Hoshi
Proceedings of the 2003 IEEE International Symposium on Information Theory, 28, Jul. 2003, Peer-reviwed
International conference proceedings, English - Some Considerations on Trapdoor Channel
K. Kobayashi; H. Morita; M.Hoshi
Proceedings of 3rd Asian-European Workshop on Information Theory, 9-10, Jun. 2003, Peer-reviwed
International conference proceedings, English - One Bit Reduction of Arithmetic Codes
H. Morita; M.Hoshi; K. Kobayashi
Proceedings of 3rd Asian-European Workshop on Information Theory, 34-36, Jun. 2003, Peer-reviwed
International conference proceedings, English - A study on construction of low density parity check code based on Galois field
K. Yamaguchi; H. Tanaka; Y. Yamamoto; K. Kobayashi
Proceeding of The 2003 International Conference on Multimedia Technology and its Applications, 15, 2003, Peer-reviwed
International conference proceedings, English - Percolation on k-ary Tree
K.Kobayashi; H. Morita; M. Hoshi
9-10, Nov. 2002, Peer-reviwed
International conference proceedings, English - An Input/Output Recursion of the Trapdoor Channel
Kingo Kobayashi; Hiroyoshi Morita
423, Jul. 2002, Peer-reviwed
International conference proceedings, English - A Reversible Distribution Converter with Finite Precision Arithmetic
Hiroyoshi Morita; MamoruHoshi; Kingo Kobayashi
404, Jul. 2002, Peer-reviwed
International conference proceedings, English - A Survey on Coding of Trees
Kingo Kobayashi; Hiroyoshi Morita; Mamoru Hoshi
50-53, Jun. 2002, Peer-reviwed
International conference proceedings, English - When the entropy function appears in the residue
Kingo Kobayashi
Abstracts of Preparatory Meetings on General Theory of Information Transfer, 38, Feb. 2002
International conference proceedings, English - An Input-Output Relation of the Trapdoor Channel
Kingo Kobayashi; Hiroyoshi Morita
Proc. of the 24th SITA, Nov. 2001
Research society, English - Reversible Distribution Converter with Finite Precision Arithmetic
Hiroyoshi Morita; Mamoru Hoshi; Kingo Kobayashi
Proc. of the 24th SITA, Nov. 2001
English - The Bernoulli Splitting Process with Biased Probabilities
Kingo Kobayashi; Mamoru Hoshi; Hiroyoshi Morita
Proc. of the 23rd SITA, 343-345, Oct. 2000
English - Log-star function and catalan code for integers
Kingo Kobayashi
IEEE, Proc. of 2000 Cornell Summer Workshop on Infomation Theory, 6-7, Aug. 2000
International conference proceedings, English - Coding of Ordered Trees
K. Kobayashi; H. Morita; M. Hoshi
15, Jun. 2000, Peer-reviwed
International conference proceedings, English - On rate of source conversion by concatenatin codes/parse trees
H. Morita; K. Kobayashi; M. Hoshi
Pric, of 2000 IEEE ISIT, 455, Jun. 2000
English - A Note on the Fix-Free Code Property
K.Harada; K.Kobayashi
IEICE Trans. Fund. of Elec., Comm. & Comp. Sci, E82-A, 10, 2121-2128, Oct. 1999, Peer-reviwed
English - Information Theoretic Aspects on Coding of Tree
K. Kobayashi; H. Morita; M. Hoshi
Proc.of Memorial Workshop for the 50th Anniversary of the Shannon Theory, 43-46, 1999, Peer-reviwed
English - On rate of source conversion by coding/parsing trees
H. Morita; K. Kobayashi; M. Hoshi
第22回情報理論とその応用学会予稿集,湯沢, 1999
English - On Fix-free Codes(invited lecture)
K. Kobayashi; H. Morita; M. Hoshi
Proceedings of Symposium on ``Numbers, Information and Complexity" in Bielefeld in honour of R.Ahlswede on the occasion of his 60th birthday,Oct. 8, 1998, Oct. 1998, Peer-reviwed
English - Distribution Converter using Prefix Trees
H.Morita; K.Kobayashi; M.Hoshi
DIMACS Workshop on Codes and Trees:Algorithmic and Information Theoretic Approaces,Oct.5-7, Oct. 1998
English - Construction method of UEP convolutional codes based on conditional weight distributions
K. Yamaguchi; T. Watanabe; K. Kobayashi
IEICE Trans. Fund. of Elec., Comm. \& Comp. Sci., vol.E81-A, No.10, 2019-2024, Oct. 1998, Peer-reviwed
Scientific journal, English - Transform of Information Source by Tree
H. Morita; K. Kobayashi; M. Hoshi
情報理論とその応用学会，第21回シンポジウム予稿集，岐阜, 487-490, 1998
English - Fix-free Codes on Finite Alphabet
K. Harada; K. Kobayashi
情報理論とその応用学会，第21回シンポジウム予稿集，岐阜, 491-494, 1998
English - 計算機科学×情報理論（招待講演）
小林欣吾
電子情報通信学会、信学技報、IT98-27, 53-57, 1998
Japanese - Universal coding of integers and unbounded search trees
R Ahlswede; TS Han; K Kobayashi
IEEE TRANSACTIONS ON INFORMATION THEORY, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 43, 2, 669-682, Mar. 1997, Peer-reviwed, In this paper we study universal coding problems for the integers, in particular, establish rather tight lower and upper bounds for the Elias omega code and other codes, In these bounds, the so-called log-star function plays a central role. Furthermore, we investigate unbounded search trees induced by these codes, including the Bentley-Yao search tree, We will reveal beautiful recursion structures latent in these search trees as well as in these codes. Finally, we introduce the modified log-star function to reveal the existance of better prefix codes than Elias omega code and other known codes.
Scientific journal, English - On a class of byte-error-correcting codes from algebraic curves and their fast decoding algorithm
M Kurihara; S Sakata; K Kobayashi
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, E79A, 9, 1298-1304, Sep. 1996, Peer-reviwed, In this paper we propose a class of byte-error-correcting codes derived from algebraic curves which is a generalization of the Reed-Solomon codes, and present their fast parallel decoding algorithm. Our algorithm can correct up to [ (m + b - theta)/2b] byte-errors for the byte length b, where m + b - theta + 1 greater than or equal to d(G) for the Goppa designed distance d(G). This decoding algorithm can be parallelized. In this algorithm, for our code over the finite field GF (q), the total complexity for finding byte-error locations is O(bt(t + q - 1)) with time complexity O(t(t + q - 1)) and space complexity O(b), and the total complexity for finding error values is O(bt(b + q - 1)) with time complexity O(b(b + q - 1)) and space complexity O(t), where t less than or equal to [ (m + b - theta)/2b]. Our byte-error-correcting algorithm is superior to the conventional fast decoding algorithm for random-errors in regard to the number of correcting byte-errors in several cases.
Scientific journal, English - Data Compression of ECG Based on the Edit Distance Algorithms
Hiroyoshi Morita; Kingo Kobayashi
IEICE Trans. Int & Syst., E76-D, 12, 1443-1453, 1993, Peer-reviwed
Scientific journal, English - On Asymptotic Optimality of a Sliding Window Variation of Lempel-Ziv Godes
Hiroyoshi Morita; Kingo Kobayashi
IEEE Transactions on Information Theory, 39, 6, 1840-1846, 1993, Peer-reviwed, Ziv and Lempel proposed two important universal coding algorithms in 1977 and 1978. While the second algorithm, called LZ78, has been sufficiently analyzed in the literature, the first, LZ77, has not yet. LZ77 parses input data into a sequence of phrases, each of which is the longest match in a fixed-sized sliding window which consists of the previously encoded M symbols. Each phrase is replaced by a pointer to denote the longest match in the window. Then, a window slides to just before the next symbol to be encoded, and so on. In this paper, we modify the algorithm of LZ77 to restrict pointers to starting only at the boundary of a previously parsed phrase in a window. Although the number of parsed phrases should increase more than those in LZ77, the amount of bits needed to encode pointers is considerably reduced since the number of possible positions to be encoded is much smaller. Then, we show that for any stationary finite state source, the modified LZ77 code is asymptotically optimal with the convergence rate O(Iog logM/log M) where M is the size of a sliding window. © 1993 IEEE
Scientific journal, English - Identifiability of Hidden Markov Information Sources and Their Degrees of Freedom
Hisashi Ito; Shun-ichi Amari; Kingo Kobayashi
IEEE Trans. on Inform. Theory, IT-38, 2, 324-333, Mar. 1992, Peer-reviwed
Scientific journal, English - The Multiterminal Filtering for Decentrolized Detection Systems
Te Sun Han; Kingo Kobayashi
IEICE Trans. Comm., E75-B, 6, 437-444, 1992, Peer-reviwed
Scientific journal, English - A Converse on the Error Exponent for Binary Channels : An Approach based on the Intersection of Spheres
Te Sun Han; Kingo Kobayashi
IEICE Trans., E-74, 9, 2465-2472, 1991, Peer-reviwed
Scientific journal, English - 情報と符号化の理論(数理科学事典、第(]G0010[)(]G0004[)章情報理論)
大阪書籍, 1991
Japanese - On the Equivalence of Hidden Markov Models
小林欣吾; 甘利俊一; 伊藤尚史
電子情報通信学会論文誌(A), J73-A, 11, 1887-1894, Nov. 1990, Peer-reviwed
Scientific journal, Japanese - Identifiability of Generalized Hidden Markov Sources and their minimam Degree of Freedom
伊藤尚史; 甘利俊一; 小林欣吾
Transactions of The Instifute of Electronics, Information and Communication Engineers, J73-A, 11, 1880-1886, 1990, Peer-reviwed
Scientific journal, Japanese - 制約付再生可能な文字列分解にもとづく計算機ファイルのデータ圧縮
森田啓義; 小林欣吾
情報処理学会論文誌, 32, 2, 110-121, 1990, Peer-reviwed
Scientific journal, Japanese - THE STRONG CONVERSE THEOREM FOR HYPOTHESIS-TESTING
TS HAN; K KOBAYASHI
IEEE TRANSACTIONS ON INFORMATION THEORY, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 35, 1, 178-180, Jan. 1989, Peer-reviwed
Scientific journal, English - EXPONENTIAL-TYPE ERROR PROBABILITIES FOR MULTITERMINAL HYPOTHESIS-TESTING
TS HAN; K KOBAYASHI
IEEE TRANSACTIONS ON INFORMATION THEORY, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 35, 1, 2-14, Jan. 1989, Peer-reviwed
Scientific journal, English - COMBINATORIAL STRUCTURE AND CAPACITY OF THE PERMUTING RELAY CHANNEL
K KOBAYASHI
IEEE TRANSACTIONS ON INFORMATION THEORY, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 33, 6, 813-826, Nov. 1987, Peer-reviwed
Scientific journal, English - A DICHOTOMY OF FUNCTIONS F(X, Y) OF CORRELATED SOURCES (X, Y) FROM THE VIEWPOINT OF THE ACHIEVABLE RATE REGION
TS HAN; K KOBAYASHI
IEEE TRANSACTIONS ON INFORMATION THEORY, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 33, 1, 69-76, Jan. 1987, Peer-reviwed
Scientific journal, English - Maximal Rectangular Subsets Contained in the Set of Partially Jointly Typical Sequences for Dependent Random Variables
Te Sun Han; Kingo Kobayashi
Zeitschrift fuer Wahrscheinlichkeitstheorie und verwandt Gebiete, 77, 15-32, 1985, Peer-reviwed
Scientific journal, English - A New Achievable Rate Region for the Interference Channel
Te Sun Han; Kingo Kobayashi
IEEE Trans. on Inform. Theory, IT-27, 1, 46-60, 1981, Peer-reviwed
Scientific journal, English
MISC
Books and other publications
- 岩波数学辞典第４版「情報理論」
日本数学会
Dictionary or encycropedia, Japanese, 岩波書店, 2007 - Mathematics of Information and Coding（共著）
T. S. Han; K.Kobayashi
English, Translations of Mathematical Monographs, American Mathematical Society, Providence, Rhode Island, Jan. 2002 - 情報と符号化の数理（共著）
韓 太舜; 小林欣吾
Japanese, 培風館, Oct. 1999 - 情報源符号化：無歪みデータ圧縮（共著）
小林欣吾他
Japanese, 情報理論とその応用学会編、培風館, Dec. 1998 - 情報のディジタル伝送(共訳)
有本卓; 小林欣吾他訳
Japanese, 森北出版, Mar. 1997 - 情報と符号化の数理
韓 太舜; 小林 欣吾
Japanese, 岩波書店, 1994 - 現代数理科学辞典(XIV 情報理論[1[情報と符号化の理論)
広中平祐他編
Dictionary or encycropedia, Japanese, 大阪書籍, 1991 - グラフの理論I,II,III（共訳）
伊理正夫; 小林欣吾他訳
Japanese, サイエンス社, 1976
Lectures, oral presentations, etc.
- Exact Density Evolution for a Simplified GF(q) LDPC Decoder on the Binary Symmetric Channel
B.M.Kurkoski; K.Yamaguchi; K.Kobayashi
Public symposium, English, 第５回シャノン理論ワークショップ, SITA, 修善寺
Sep. 2007 - Reed-Solomon符号の消失誤り訂正による硬入力軟出力復号を用いたターボ復号法の一考察
前原進也; ブライアン クルカスキー; 山口和彦; 小林欣吾
Oral presentation, Japanese, 電子情報通信学会技報IT2006-111, ISEC2006-166, WBS2006-108,,サブソサイエティ合同研究会
2007 - Pixel Based Steganography with Integrity
朴 英蘭; 姜 玄浩; 山口 和彦; 小林 欣吾
Public symposium, English, 2007年 暗号と情報セキュリティシンポジウム, 電子情報通信学会
2007 - 心理聴覚モデルとパッチワークアルゴリズムを用いた音楽電子透かし
山口 恒太郎; 姜 玄浩; 山口 和彦; 小林 欣吾
Public symposium, Japanese, 2007年 暗号と情報セキュリティシンポジウム, 電子情報通信学会
2007 - Watermarking with permissible alterations
姜 玄浩; 朴 英蘭; ブライアン クルカスキー; 山口 和彦; 小林 欣吾
Public symposium, English, 2007年 暗号と情報セキュリティシンポジウム, 電子情報通信学会
2007 - ウェーブレット変換に基づく誤り訂正符号を用いた改ざん復元可能な電子透かし
辰巳 輝洋; 姜 玄浩; 山口 和彦; 小林 欣吾
Public symposium, Japanese, 2007年 暗号と情報セキュリティシンポジウム, 電子情報通信学会
2007 - Detecting malicious attacks using semi-fragile watermark based on visual model
H. Kang; B. Kurkoski; K. Yamaguchi; K. Kobayashi
Public symposium, English, IEEE Mexican Conf. on Informatics Security 2006 (MCIS2006), IEEE, Oaxaca, Mexico
Nov. 2006 - Increasing Robustness of Audio Watermarking DM using ATHC Codes
R. Martinez-Noriega; H. Kang; B. Kurkoski; K. Yamaguchi; K. Kobayashi; M. Nakano
Public symposium, English, IEEE Mexican Conference on Informatics Security 2006 (MCIS2006), IEEE, Oaxaca, Mexico
Nov. 2006 - Multi-user Information Theory Revisited
K. Kobayashi
Invited oral presentation, English, Proceeding on International Symposium on Advanced Robotics and Machine Intelligence, Chinese Univ. of Hong Kong, Beijin, China, International conference
Oct. 2006 - LDPC符号を用いた不均 一誤り保護符号に関する2,3の考察
佐藤邦和; 小林欣吾; 山口和彦; クルカスキー ブライアン
Oral presentation, Japanese, 電子情報通信学会信学技報
Jul. 2006 - Tracing Illegal Users of Video Content: Reconsideration of Tree-Specific and Endbuyer Specific Methods
Hyunho Kang; Brian Kurkoski; Kazuhiko Yamaguchi; Kingo Kobayashi
Public symposium, English, 2006年暗号と情報セキュリティシンポジウム, 電子情報通信学会
2006 - A note on the capacity problem for interference channels
T.S.Han; K.Kobayashi
Invited oral presentation, English, Proceeding of Asian-European Workshop on Concepts in Information Theory, Jeju, Korea, International conference
2006 - 魔方陣を利用するビデオの違法配信の探知
姜 玄浩; 山口 和彦; 小林 欣吾
Public symposium, Japanese, 第29回 情報理論とその応用シンポジウム, 情報理論とその応用学会, 函館
2006 - Integrity Verification of Secret Information in Image Steganography
Y. Park; H. Kang; K.Yamaguchi; K. Kobayashi
Public symposium, English, 第29回 情報理論とその応用シンポジウム, 情報理論とその応用学会, 函館
2006 - Noise Thresholds for GF(q) LDPC Codes Using Reduced-Complexity Decoding
Brian Kurkoski; Kazuhiko Yamaguchi; Kingo Kobayashi
Public symposium, English, 第29回 情報理論とその応用シンポジウム, 情報理論とその応用学会, 函館
2006 - 低密度パリティ検査符号を用いた不均一誤り保護符号の新たな構成法とその考察
佐藤 邦和; 山口 和彦; 小林 欣吾; ブライアン クルカスキー
Public symposium, Japanese, 第29回 情報理論とその応用シンポジウム, 情報理論とその応用学会, 函館
2006 - Turbo Decoding Based on the Lookup-Table Algorithm
Brian Kurkoski; Kazuhiko Yamaguchi; Kingo Kobayashi
Public symposium, English, 第28回情報理論とその応用シンボジウム, 情報理論とその応用学会, 沖縄・恩納
2005 - Reed-Solomon符号の硬判定復号を用いた連接符号のターボ復号の評価
前原進也; ブライアン クルカスキー; 山口和彦; 小林欣吾
Public symposium, Japanese, 第28回情報理論とその応用シンボジウム, 情報理論とその応用学会, 沖縄・恩納
2005 - Tracing Illegal Users of Video Content Using Watermarking and Fingerprinting
Hyunho Kang; Brian Kurkoski; Kazuhiko Yamaguchi; Kingo Kobayashi
Public symposium, English, 第28回情報理論とその応用シンボジウム, 情報理論とその応用学会, 沖縄・恩納
2005 - 木情報源の符号化
小林欣吾
Invited oral presentation, Japanese, 京都大学数理解析研究所講究録「符号と暗号の代数的数理」, 京都
Apr. 2004 - Interval Algorithm, Arithmetic Coding, and Shift Operator
M.Hoshi; H.Morita; K.Kobayashi
Invited oral presentation, English, Proceedings of 4rd Asian-European Workshop on Information Theory, Viarragio, International conference
Apr. 2004 - 情報理論の愉しみ(IEICE Fellow 受賞講演)
小林欣吾
Invited oral presentation, Japanese, 基礎・境界ソサエティ全国大会, 電子情報通信学会
2004 - A Survey of Multi User Information Theory
K.Kobayashi
Invited oral presentation, English, Conference on General Theory of Information Transfer and Combinatorics, Bielefeld, International conference
Aug. 2003 - Some Considerations on Trapdoor Channel
K. Kobayashi; H. Morita; M.Hoshi
Invited oral presentation, English, Proceedings of 3rd Asian-European Workshop on Information Theory, International conference
Jun. 2003 - One Bit Reduction of Arithmetic Codes
H. Morita; M.Hoshi; K. Kobayashi
Invited oral presentation, English, Proceedings of 3rd Asian-European Workshop on Information Theory, International conference
Jun. 2003 - Percolation on k-ary Tree
K.Kobayashi; H. Morita; M. Hoshi
Invited oral presentation, English, International conference
Nov. 2002 - Log-star Function and Catalan Code for Integers
Kingo Kobayashi
Oral presentation, English, Proc. of the 23rd SITA
Oct. 2000 - Log-star function and catalan code for integers
Kingo Kobayashi
Invited oral presentation, English, IEEE, Proc. of 2000 Cornell Summer Workshop on Infomation Theory, International conference
Aug. 2000 - On Fix-free Codes(invited lecture)
K. Kobayashi; H. Morita; M. Hoshi
Invited oral presentation, English, Proceedings of Symposium on ``Numbers, Information and Complexity" in Bielefeld in honour of R.Ahlswede on the occasion of his 60th birthday,Oct. 8, 1998, International conference
Oct. 1998