Results 1  10
of
738
On the Distinguishability of DistanceBounded Permutations in Ordered Channels
, 2008
"... Ordered channels, such as those provided by Internet protocol and transmission control protocol protocols, rely on sequence numbers to recover from packet reordering due to network dynamics. The existence of covert channels in any ordered channel is a wellknown fact: Two parties can reorder the el ..."
Abstract
 Add to MetaCart
the elements (packets) to be sent according to some predefined code. Schemes based on distancebounded permutations have been proposed for steganographic communication with the aim of keeping and controling the increase of latency due to reordering. In this paper, we demonstrate that distancebounded
Yet Another Secure DistanceBounding Protocol
"... Abstract. Distancebounding protocols have been proposed by Brands and Chaum in 1993 in order to detect relay attacks, also known as mafia fraud. Although the idea has been introduced fifteen years ago, only recently distancebounding protocols attracted the attention of the researchers. Several new ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract. Distancebounding protocols have been proposed by Brands and Chaum in 1993 in order to detect relay attacks, also known as mafia fraud. Although the idea has been introduced fifteen years ago, only recently distancebounding protocols attracted the attention of the researchers. Several
A power controlled multiple access protocol for wireless packet networks
, 2001
"... Abstract — Multiple accessbased collision avoidance MAC protocols have typically used fixed transmission power, and have not considered power control mechanisms based on the distance of the transmitter and receiver in order to improve spatial channel reuse. This work proposes PCMA, a power controll ..."
Abstract

Cited by 242 (2 self)
 Add to MetaCart
Abstract — Multiple accessbased collision avoidance MAC protocols have typically used fixed transmission power, and have not considered power control mechanisms based on the distance of the transmitter and receiver in order to improve spatial channel reuse. This work proposes PCMA, a power
Steganographic Communication in Ordered Channels
"... Abstract. In this paper we focus on estimating the amount of information that can be embedded in the sequencing of packets in ordered channels. Ordered channels, e.g. TCP, rely on sequence numbers to recover from packet loss and packet reordering. We propose a formal model for transmitting informati ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
process (minmax) and prove the existence of a Nash equilibrium for the mutual information rate. We study the zeroerror (discrete) equivalent and provide errorcorrecting codes with optimal performance for the distancebounded model, along with efficient encoding and decoding algorithms. One outcome
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
space, sensitivity encoding by means of a receiver array permits reduction of the number of Fourier encoding steps. This is achieved by increasing the distance of sampling positions in kspace while maintaining the maximum kvalues. Thus scan time is reduced at preserved spatial resolution. The factor by which
of algorithms for decoding block codes with channel measurement information
 IEEE Transactions on Information Theory
, 1972
"... AbstractA class of decoding algorithms that utilizes channel measurement information, in addition to the conventional use of the algebraic properties of the code, is presented. The maximum number of errors that can, with high probability, be corrected is equal to one less than d, the minimum Hammin ..."
Abstract

Cited by 140 (0 self)
 Add to MetaCart
Hamming distance of the code. This twofold increase over the errorcorrecting capability of a conventional binary decoder is achieved by using channel measurement (softdecision) information to provide a measure of the relative reliability of each of the received binary digits. An upper bound
Effective Proximity Retrieval by Ordering Permutations
, 2007
"... We introduce a new probabilistic proximity search algorithm for range and Knearest neighbor (KNN) searching in both coordinate and metric spaces. Although there exist solutions for these problems, they boil down to a linear scan when the space is intrinsically highdimensional, as is the case in m ..."
Abstract

Cited by 34 (6 self)
 Add to MetaCart
in many pattern recognition tasks. This, for example, renders the KNN approach to classification rather slow in large databases. Our novel idea is to predict closeness between elements according to how they order their distances towards a distinguished set of anchor objects. Each element in the space
Arc permutations
 J. Algebraic Combin
"... Arc permutations and unimodal permutations were introduced in the study of triangulations and characters. This paper studies combinatorial properties and structures on these permutations. First, both sets are characterized by pattern avoidance. It is also shown that arc permutations carry a natura ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
natural affine Weyl group action, and that the number of geodesics between a distinguished pair of antipodes in the associated Schreier graph, as well as the number of maximal chains in the weak order on unimodal permutations, are both equal to twice the number of standard Young tableaux of shifted
Constructions of binary constantweight cyclic codes and cyclically permutable codes
 IEEE Trans. Inform. Theory
, 1992
"... AbstractA general theorem is proved showing how to ohtain a constantweight binary cyclic code from a pary linear cyclic code, where p is a prime,. by using a representation of Cl;(p) as cyclic shifts of a binary ptuple. Based on this theorem, constructions are given for four classes of binary co ..."
Abstract

Cited by 32 (0 self)
 Add to MetaCart
constantweight codes. The first two classes are shown to achieve the Johnson upper bound on minimum distance asymptotically for long block lengths. The other two classes are shown similarly to asymptotically meet the lowrate Plotkin upper bound on minimum distance. A cyclically permutable code is a
Improved Security Bounds for KeyAlternating Ciphers via Hellinger Distance
"... Atroundkey alternating cipher canbeviewedasanabstractionofAES.ItdefinesacipherE from t fixed public permutations P1,...,Pt: {0,1} n → {0,1} n and a key k = k0‖···‖kt ∈ {0,1} n(t+1) by setting Ek(x) = kt ⊕ Pt(kt−1 ⊕ Pt−1(···k1 ⊕ P1(k0 ⊕ x)···)). The indistinguishability of Ek from a random truly ra ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
indistinguishability up to 22n/3 queries for t ≥ 2 (ignoring loworder terms). Our contribution is to improve the analysis of Bogdanov et al. by showing security up to 23n/4 queries for t ≥ 3. Given that security cannot exceed 2 t t+1n queries, this is in particular achieves a tight bound for the case t = 3, whereas
Results 1  10
of
738