Keyword : minimum distance


Power Allocation for Zero-Forcing Strategy in Two-User X Channel
Xianglan JIN 
Publication:   
Publication Date: 2018/08/01
Vol. E101-B  No. 8 ; pp. 1916-1922
Type of Manuscript:  PAPER
Category: Wireless Communication Technologies
Keyword: 
minimum distancepower allocationpower constraintsymbol error rate
 Summary | Full Text:PDF(625.4KB)

Further Results on the Minimum and Stopping Distances of Full-Length RS-LDPC Codes
Haiyang LIU Hao ZHANG Lianrong MA 
Publication:   
Publication Date: 2017/02/01
Vol. E100-A  No. 2 ; pp. 738-742
Type of Manuscript:  LETTER
Category: Coding Theory
Keyword: 
low-density parity-check (LDPC) codesRS-LDPC codesminimum distancestopping distance
 Summary | Full Text:PDF(91.5KB)

On the Rank Bounded Distance with Conjugate Elements for Cyclic Codes
Junru ZHENG Takayasu KAIDA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2015/12/01
Vol. E98-A  No. 12 ; pp. 2476-2479
Type of Manuscript:  Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
defining setdiscrete Fourier transformrank bounded distanceminimum distancecyclic code
 Summary | Full Text:PDF(99.8KB)

Construction of Independent Set and Its Application for Designed Minimum Distance
Junru ZHENG Takayasu KAIDA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2012/12/01
Vol. E95-A  No. 12 ; pp. 2107-2112
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
discrete Fourier transformindependent setshift boundminimum distancecyclic code
 Summary | Full Text:PDF(517.3KB)

Lowering Error Floors of Irregular LDPC Codes by Combining Construction and Decoding
Xiaopeng JIAO Jianjun MU Fan FANG Rong SUN 
Publication:   IEICE TRANSACTIONS on Communications
Publication Date: 2012/01/01
Vol. E95-B  No. 1 ; pp. 271-274
Type of Manuscript:  LETTER
Category: Fundamental Theories for Communications
Keyword: 
error floorlow-density parity-check (LDPC) codesminimum distancetrapping sets
 Summary | Full Text:PDF(272.9KB)

A Note on the Shift Bound for Cyclic Codes by the DFT
Junru ZHENG Takayasu KAIDA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2010/11/01
Vol. E93-A  No. 11 ; pp. 1918-1922
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
Blahut theoremlower bounddiscrete Fourier transformcyclic codeminimum distance
 Summary | Full Text:PDF(251.5KB)

On Relationship between the Boston Bound and Well-Known Bounds for Cyclic Codes
Junru ZHENG Takayasu KAIDA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/10/01
Vol. E92-A  No. 10 ; pp. 2484-2486
Type of Manuscript:  Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
Boston boundcyclic codedefining setBCH boundHartmann-Tzeng boundminimum distance
 Summary | Full Text:PDF(72.3KB)

A Probabilistic Algorithm for Computing the Weight Distribution of LDPC Codes
Masanori HIROTOMO Masami MOHRI Masakatu MORII 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/07/01
Vol. E92-A  No. 7 ; pp. 1677-1689
Type of Manuscript:  PAPER
Category: Coding Theory
Keyword: 
LDPC codesweight distributionprobabilistic methodminimum distance
 Summary | Full Text:PDF(431.1KB)

On the Minimum Weight of Simple Full-Length Array LDPC Codes
Kenji SUGIYAMA Yuichi KAJI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2008/06/01
Vol. E91-A  No. 6 ; pp. 1502-1508
Type of Manuscript:  PAPER
Category: Coding Theory
Keyword: 
LDPC codesimple full-length array LDPC codeminimum weightminimum distance
 Summary | Full Text:PDF(208.9KB)

A Construction of High Rate Quasi-Cyclic Regular LDPC Codes from Cyclic Difference Families with Girth 8
Masaya FUJISAWA Shojiro SAKATA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2007/05/01
Vol. E90-A  No. 5 ; pp. 1055-1061
Type of Manuscript:  PAPER
Category: Coding Theory
Keyword: 
LDPC codequasi-cyclic codecyclic difference familygirthminimum distance
 Summary | Full Text:PDF(441.3KB)

On Linear Complexity and Schaub Bound for Cyclic Codes by Defining Sequence with Unknown Elements
Junru ZHENG Takayasu KAIDA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/09/01
Vol. E89-A  No. 9 ; pp. 2337-2340
Type of Manuscript:  Special Section LETTER (Special Section on Sequence Design and its Application in Communications)
Category: 
Keyword: 
cyclic codedefining sequenceminimum distancelower boundSchaub algorithmunknown element
 Summary | Full Text:PDF(95.5KB)

On the Feng-Rao Bound for the L-construction of Algebraic Geometry Codes
Ryutaroh MATSUMOTO Shinji MIURA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2000/05/25
Vol. E83-A  No. 5 ; pp. 923-926
Type of Manuscript:  LETTER
Category: Information Theory
Keyword: 
algebraic geometry codeminimum distancedecodingL-construction
 Summary | Full Text:PDF(181.8KB)

On the Minimum Distance of Concatenated Codes and Decoding Method up to the True Minimum Distance
Toshiyuki KOHNOSU Toshihisa NISHIJIMA Shigeichi HIRASAWA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/11/25
Vol. E80-A  No. 11 ; pp. 2111-2116
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
concatenated codeminimum distancecomplete weight enumeratorReddy-Robinson algorithmdecoding method beyond the BCH bound
 Summary | Full Text:PDF(478.5KB)

Relations between Several Minimum Distance Bounds of Binary Cyclic Codes
Taku MATSUO Yutaka ARAKI Kyoki IMAMURA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/11/25
Vol. E80-A  No. 11 ; pp. 2253-2255
Type of Manuscript:  Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Coding Theory/Communication
Keyword: 
binary cyclic codesminimum distancelower bounds
 Summary | Full Text:PDF(127.9KB)

On the Minimum Distance of Binary Concatenated Codes
Toshiyuki KOHNOSU Toshihisa NISHIJIMA Shigeichi HIRASAWA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/05/25
Vol. E80-A  No. 5 ; pp. 922-923
Type of Manuscript:  LETTER
Category: Information Theory and Coding Theory
Keyword: 
concatenated codeminimum distance
 Summary | Full Text:PDF(126.3KB)