#### Filter Results:

#### Publication Year

2001

2013

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

—Mappings of the set of binary vectors of a fixed length to the set of permutations of the same length are useful for the construction of permutation codes. In this correspondence, several explicit constructions of such mappings preserving or increasing the Hamming distance are given. Some applications are given to illustrate the usefulness of the… (More)

We study the problem how to construct an RFID mutual authentication protocol between tags and readers. Juels (in Journal on Selected Areas in Communications, 2006) proposed an open question which asks whether there exists a fully privacy-preserving RFID authentication protocol in which the time complexity of a successful authentication phase can be done in… (More)

—In this paper, we propose a new approach to establishing application layer conference trees for multimedia multi-point conferences on the Internet using the Megaco/H.248 protocol, a Voice over IP (VoIP) media gateway control protocol. In existing VoIP protocols (and also legacy telephone networks), a multipoint conference takes place through an MCU, and… (More)

Symmetric Boolean functions depending on an odd number of variables with maximum algebraic immunity, " IEEE Trans. Abstract—Permutation arrays have found applications in powerline communication. One construction method for permutation arrays is to map good codes to permutations using a distance-preserving mappings (DPM). DPMs are mappings from the set of… (More)

Permutation arrays (PAs, or permutation codes) are useful in communication over power lines. Distance-increasing mappings (DIMs) from the set of binary vectors of a fixed length to the set of permutations of the same length that strictly increase Hamming distances (except when that is obviously not possible) are useful to construct permutation arrays. In… (More)

A consecutive-k-n network is a generalization of the well-known consecutive -k-out-of-n system, and has many practical applications. This network consists of n + 2 nodes (node 0, the source, nodes 1, 2, …, n, and node n + 1, the target) and directed links from node i to node j (0 ≤ i < j ≤ n + 1, j − i ≤ k). Because all nodes except the source and target,… (More)