Arrow Research search

Author name cluster

Jon T. Butler

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

FLAP Journal 2023 Journal Article

On Representation of Maximally Asymmetric Functions Based on Decision Diagrams.

  • Shinobu Nagayama
  • Tsutomu Sasao
  • Jon T. Butler

Maximally asymmetric functions are multiple-valued functions that have the maximum distance from their nearest symmetric functions, in terms of Hamming distance. Maximally asymmetric functions can be promising for ap- plications such as radio communication and cryptography, due to randomness of the functions. To promote such application studies, benchmarks for maxi- mally asymmetric functions in compact form are needed. However, few studies on benchmark generation or even on characteristics for maximally asymmet- ric functions have been reported. Thus, this paper investigates representation of maximally asymmetric functions based on decision diagrams. This paper begins with proposing a method to compute asymmetry of a given function easily, and then, derives a new characteristic of maximally asymmetric func- tions based on the computation method. Using the derived characteristic, we also propose a method to automatically generate benchmarks for maximally asymmetric functions represented by decision diagrams. By comparing sizes of different types of decision diagrams, we consider suitable representations for maximally asymmetric functions. This paper is an extension of [24].

FLAP Journal 2018 Journal Article

An Exact Optimization Method using ZDDs for Linear Decomposition of Symmetric Index Generation Functions.

  • Shinobu Nagayama
  • Tsutomu Sasao
  • Jon T. Butler

This paper proposes a method using zero-suppressed binary decision diagrams (ZDDs) to find an exact optimum linear decomposition of symmetric index genera- tion functions. The proposed optimization method recursively divides an index set of a symmetric index generation function, based on a branch and bound approach. The method uses ZDDs to represent partitions of an index set compactly and uniquely, and thus, it reuses partial solutions (partitions of an index set) efficiently to prune redun- dant solution search. In addition, by taking advantages of the symmetry property, the method reduces search space significantly, and can find an optimum solution quickly. Experimental results using benchmark symmetric index generation functions show ef- fectiveness of the proposed method.

v2026.09.13