IEICE Trans

Keyword : lower bound

Density of Pooling Matrices vs. Sparsity of Signals for Group Testing Problems Jin-Taek SEONG
Publication: Publication Date: 2019/05/01 Vol. E102-D No. 5 ; pp. 1081-1084 Type of Manuscript: LETTER Category: Fundamentals of Information Systems Keyword: group testing, lower bound, pooling matrix, sparsity,
	Summary \| Full Text:PDF(207.5KB)

Accelerating a Lloyd-Type k-Means Clustering Algorithm with Summable Lower Bounds in a Lower-Dimensional Space Kazuo AOYAMA Kazumi SAITO Tetsuo IKEDA
Publication: Publication Date: 2018/11/01 Vol. E101-D No. 11 ; pp. 2773-2783 Type of Manuscript: PAPER Category: Artificial Intelligence, Data Mining Keyword: algorithm, clustering, k-means, lower bound, singular value decomposition, principal component analysis, dimensionality reduction, performance,
	Summary \| Full Text:PDF(759KB)

Throughput Optimization with Random Network Coding in Multi-Source Multi-Relay System Guojie HU Kui XU Youyun XU
Publication: Publication Date: 2017/07/01 Vol. E100-A No. 7 ; pp. 1592-1595 Type of Manuscript: LETTER Category: Coding Theory Keyword: optimal throughput, upper bound, lower bound, erasure probability,
	Summary \| Full Text:PDF(174.3KB)

A Visibility-Based Lower Bound for Android Unlock Patterns Jinwoo LEE Jae Woo SEO Kookrae CHO Pil Joong LEE Dae Hyun YUM
Publication: Publication Date: 2017/03/01 Vol. E100-D No. 3 ; pp. 578-581 Type of Manuscript: LETTER Category: Information Network Keyword: user authentication, graphical password, Android unlock patterns, lower bound,
	Summary \| Full Text:PDF(135.1KB)

Cooperative Local Repair with Multiple Erasure Tolerance Jiyong LU Xuan GUANG Linzhi SHEN Fang-Wei FU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2016/03/01 Vol. E99-A No. 3 ; pp. 765-769 Type of Manuscript: LETTER Category: Coding Theory Keyword: distributed storage, repair locality, information set, information coordinate, lower bound,
	Summary \| Full Text:PDF(113.8KB)

A Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits Takashi HIRAYAMA Hayato SUGAWARA Katsuhisa YAMANAKA Yasuaki NISHITANI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2014/09/01 Vol. E97-D No. 9 ; pp. 2253-2261 Type of Manuscript: Special Section PAPER (Special Section on Multiple-Valued Logic and VLSI Computing) Category: Reversible/Quantum Computing Keyword: reversible logic circuits, Toffoli gates, lower bound, logic minimization,
	Summary \| Full Text:PDF(584.4KB)

A Novel CS Model and Its Application in Complex SAR Image Compression Wentao LV Gaohuan LV Junfeng WANG Wenxian YU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2013/11/01 Vol. E96-A No. 11 ; pp. 2209-2217 Type of Manuscript: PAPER Category: Digital Signal Processing Keyword: compressed sensing, mutual coherence, lower bound, Gram matrix, complex SAR image compression,
	Summary \| Full Text:PDF(1.2MB)

Lower Bounds on the Aperiodic Hamming Correlations of Frequency Hopping Sequences Xing LIU Daiyuan PENG Xianhua NIU Fang LIU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2013/06/01 Vol. E96-A No. 6 ; pp. 1445-1450 Type of Manuscript: PAPER Category: Spread Spectrum Technologies and Applications Keyword: frequency hopping sequences, frequency hopping spread spectrum, aperiodic Hamming correlation, the Peng-Fan bound, lower bound,
	Summary \| Full Text:PDF(822KB)

Tight Lower Bounds on Achievable Information Rates for Regularized Tomlinson-Harashima Precoding in Multi-User MIMO Systems Bing HUI Manar MOHAISEN KyungHi CHANG
Publication: IEICE TRANSACTIONS on Communications Publication Date: 2012/04/01 Vol. E95-B No. 4 ; pp. 1463-1466 Type of Manuscript: LETTER Category: Wireless Communication Technologies Keyword: Tomlinson-Harashima precoding, information rates, lower bound, MIMO, MMSE,
	Summary \| Full Text:PDF(177.2KB)

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 theorem, lower bound, discrete Fourier transform, cyclic code, minimum distance,
	Summary \| Full Text:PDF(251.5KB)

Constructing and Counting Boolean Functions on Even Variables with Maximum Algebraic Immunity Yuan LI Min YANG Haibin KAN
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2010/03/01 Vol. E93-A No. 3 ; pp. 640-643 Type of Manuscript: LETTER Category: Cryptography and Information Security Keyword: Boolean functions, algebraic attack, algebraic immunity, construction, lower bound,
	Summary \| Full Text:PDF(91.9KB)

Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size Takehiro ITO Kazuya GOTO Xiao ZHOU Takao NISHIZEKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2007/02/01 Vol. E90-D No. 2 ; pp. 449-456 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Graph Algorithms Keyword: algorithm, choice partition, lower bound, maximum partition problem, minimum partition problem, multi-weighted graph, partial k-tree, series-parallel graph, uniform partition, upper bound,
	Summary \| Full Text:PDF(384.9KB)

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 code, defining sequence, minimum distance, lower bound, Schaub algorithm, unknown element,
	Summary \| Full Text:PDF(95.5KB)

Analysis and Design of Multicast Routing and Wavelength Assignment in Mesh and Multi-Ring WDM Transport Networks with Multiple Fiber Systems Charoenchai BOWORNTUMMARAT Lunchakorn WUTTISITTIKULKIJ Sak SEGKHOONTHOD
Publication: IEICE TRANSACTIONS on Communications Publication Date: 2004/11/01 Vol. E87-B No. 11 ; pp. 3216-3229 Type of Manuscript: PAPER Category: Network Keyword: multicast routing and wavelength assignment, mesh design, multi-ring design, light-tree, fanout, integer linear programming, lower bound, network connectivity,
	Summary \| Full Text:PDF(1.7MB)

Minimum Number of Comparators in (6,6)-Merging Network Koichi YAMAZAKI Hibiki MIZUNO Kazuhisa MASUDA Shigeki IWATA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2000/02/25 Vol. E83-D No. 2 ; pp. 137-141 Type of Manuscript: PAPER Category: Theory/Models of Computation Keyword: merging network, comparator, lower bound,
	Summary \| Full Text:PDF(768.2KB)

The Evaluations on Lower Bounds of All-Terminal Reliability by Arc-Packings for General Networks Takeshi KOIDE Shuichi SHINMORI Hiroaki ISHII
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1999/05/25 Vol. E82-A No. 5 ; pp. 784-791 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: probabilistic graph, network reliability, arc-packing, acyclic graph, lower bound,
	Summary \| Full Text:PDF(847.2KB)

An Exponential Lower Bound on the Size of a Binary Moment Diagram Representing Integer Division Masaki NAKANISHI Kiyoharu HAMAGUCHI Toshinobu KASHIWABARA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1999/05/25 Vol. E82-A No. 5 ; pp. 756-766 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: binary moment diagram, division, lower bound,
	Summary \| Full Text:PDF(610.8KB)

Exponential Lower Bounds on the Size of Variants of OBDD Representing Integer Division Takashi HORIYAMA Shuzo YAJIMA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1998/08/25 Vol. E81-D No. 8 ; pp. 793-800 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword: Boolean function, division, binary decision diagrams, lower bound, fooling set,
	Summary \| Full Text:PDF(668.3KB)

Lower Bounds on Size of Periodic Functions in Exclusive-OR Sum-of-Products Expressions Yasuaki NISHITANI Kensuke SHIMIZU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1994/03/25 Vol. E77-A No. 3 ; pp. 475-482 Type of Manuscript: Special Section PAPER (Special Section on the 6th Karuizawa Workshop on Circuits and Systems) Category: Computer Aided Design (CAD) Keyword: exclusive-OR sum-of-products, size of circuits, lower bound, logic minimization, logic design,
	Summary \| Full Text:PDF(619.5KB)

Single-Shot Evaluation of Stability Hypercube and Hyperball in Polynomial Coefficient Space Takehiro MORI Hideki KOKAME
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1993/11/25 Vol. E76-A No. 11 ; pp. 2036-2038 Type of Manuscript: LETTER Category: Control and Computing Keyword: stabiliby robustness measure, coefficient space, lower bound,
	Summary \| Full Text:PDF(219.5KB)