IEICE Trans

Keyword : linear code

A Construction of Binary Punctured Linear Codes and A Supporting Method for Best Code Search Takuya OHARA Makoto TAKITA Masakatu MORII
Publication: Publication Date: 2022/03/01 Vol. E105-A No. 3 ; pp. 372-380 Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications) Category: Coding Theory Keyword: best code, modified code, linear code, weight distribution, minimum distance,
	Summary \| Full Text:PDF

A Class of Binary Cyclic Codes and Their Weight Distributions Chao HE Rong LUO Mei YANG
Publication: Publication Date: 2020/03/01 Vol. E103-A No. 3 ; pp. 634-637 Type of Manuscript: LETTER Category: Coding Theory Keyword: linear code, cyclic code, binary code, Gauss period, weight distribution,
	Summary \| Full Text:PDF

A Family of q-Ary Cyclic Codes with Optimal Parameters Wenhua ZHANG Shidong ZHANG Yong WANG Jianpeng WANG
Publication: Publication Date: 2020/03/01 Vol. E103-A No. 3 ; pp. 631-633 Type of Manuscript: LETTER Category: Coding Theory Keyword: linear code, cyclic code, Hamming distance, minimum distance, optimal code,
	Summary \| Full Text:PDF

Two Classes of Linear Codes with Two or Three Weights Guangkui XU Xiwang CAO Jian GAO Gaojun LUO
Publication: Publication Date: 2018/12/01 Vol. E101-A No. 12 ; pp. 2366-2373 Type of Manuscript: Special Section PAPER (Special Section on Signal Design and Its Applications in Communications) Category: Coding Theory Keyword: linear code, Walsh transform, non-quadratic function, permutation polynomial, weight distribution,
	Summary \| Full Text:PDF

A Family of at Least Almost Optimal p-Ary Cyclic Codes Xia LI Deng TANG Feng CHENG
Publication: Publication Date: 2017/09/01 Vol. E100-A No. 9 ; pp. 2048-2051 Type of Manuscript: LETTER Category: Coding Theory Keyword: cyclic code, linear code, Hamming distance, minimal distance,
	Summary \| Full Text:PDF

A Class of Binary Cyclic Codes with Four Weights Rong LUO Long WEI Feng CHENG Xiaoni DU
Publication: Publication Date: 2017/04/01 Vol. E100-A No. 4 ; pp. 965-968 Type of Manuscript: Special Section LETTER (Special Section on Signal Design and Its Applications in Communications) Category: Coding Theory Keyword: linear code, cyclic code, few-weight code, Hamming weights, Gaussian period,
	Summary \| Full Text:PDF

The Depth Spectra of Linear Codes over F₂+uF₂+u²F₂ Ting YAO Minjia SHI Ya CHEN
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2016/01/01 Vol. E99-A No. 1 ; pp. 429-432 Type of Manuscript: LETTER Category: Coding Theory Keyword: linear code, generator matrix, derivative, depth distribution, depth spectrum,
	Summary \| Full Text:PDF

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 scheme, linear code, relative generalized Hamming weight, relative dimension/length profile,
	Summary \| Full Text:PDF

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 sequence, LDPC code, linear code, Slepian-Wolf coding,
	Summary \| Full Text:PDF

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 source, Hamming distortion, linear code, lossy source coding,
	Summary \| Full Text:PDF

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: cryptography, information security, all-or-nothing transform, encryption mode, linear code,
	Summary \| Full Text:PDF

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/25 Vol. E79-A No. 5 ; pp. 687-693 Type of Manuscript: PAPER Category: Information Theory and Coding Theory Keyword: coding of multiple access channel, uniquely decodable, independence number, simple graph, linear code,
	Summary \| Full Text:PDF

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/25 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 channel, uniquely decodable, linear code,
	Summary \| Full Text:PDF

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/25 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 code, block code, trellis diagram, Reed-Muller code,
	Summary \| Full Text:PDF