IEICE SEARCH SYSTEM

Keyword : lower bound

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.8KB)

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 (250.8KB)

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.1KB)

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 (386.5KB)

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 (96.2KB)

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/20 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 (770.8KB)

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/20 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 (614.8KB)

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/20 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 (850.7KB)

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/20 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 (670KB)

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/20 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/20 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 (220.5KB)