Keyword : linear code


Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight
Jun KURIHARA  Tomohiko UYEMATSU  Ryutaroh MATSUMOTO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2012/11/01
Vol. E95-A  No. 11  pp. 2067-2075
Type of Manuscript: PAPER
Category: Information Theory
Keyword: 
secret sharing schemelinear coderelative generalized Hamming weightrelative dimension/length profile
  Summary |  Full Text:PDF (343.6KB)

Slepian-Wolf Coding of Individual Sequences Based on Ensembles of Linear Functions
Shigeaki KUZUOKA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/10/01
Vol. E92-A  No. 10  pp. 2393-2401
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Shannon Theory
Keyword: 
individual sequenceLDPC codelinear codeSlepian-Wolf coding
  Summary |  Full Text:PDF (176.8KB)

On the Suboptimality of Linear Lossy Codes
Shigeaki KUZUOKA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2008/10/01
Vol. E91-A  No. 10  pp. 2868-2869
Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Information Theory
Keyword: 
binary sourceHamming distortionlinear codelossy source coding
  Summary |  Full Text:PDF (63.4KB)

All-or-Nothing Transform Based on a Linear Code
Hidenori KUWAKADO  Hatsukazu TANAKA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2002/05/01
Vol. E85-A  No. 5  pp. 1084-1087
Type of Manuscript: Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
cryptographyinformation securityall-or-nothing transformencryption modelinear code
  Summary |  Full Text:PDF (136.4KB)

A Bound on Uniquely Decodable Code Pair for Two-User Binary Adder Channel
Jian-Jun SHI  Yoichiro WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/05/20
Vol. E79-A  No. 5  pp. 687-693
Type of Manuscript: PAPER
Category: Information Theory and Coding Theory
Keyword: 
coding of multiple access channeluniquely decodableindependence numbersimple graphlinear code
  Summary |  Full Text:PDF (455.9KB)

Uniquely Decodable Code for Three-User Binary Adder Channel
Jian-Jun SHI  Yoichiro WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1995/09/20
Vol. E78-A  No. 9  pp. 1206-1208
Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: 
Keyword: 
coding of multiple access channeluniquely decodablelinear code
  Summary |  Full Text:PDF (169.8KB)

On Structural Complexity of the L-Section Minimal Trellis Diagrams for Binary Linear Block Codes
Tadao KASAMI  Toyoo TAKATA  Toru FUJIWARA  Shu LIN 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/09/20
Vol. E76-A  No. 9  pp. 1411-1421
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: 
Keyword: 
linear codeblock codetrellis diagramReed-Muller code
  Summary |  Full Text:PDF (821.7KB)