This memo presents a method to reduce the complexity of trellis-based scalar-vector quantizers (TB-SVQ).
The use of strings is standard in modeling the temporal ordering of events in a sequential computation.
We consider universal compression schemes for a rate distortion problem in which the goal is to reproduce a string which is equivalent to the original string and we show that for a large collection
A communication network can be viewed as a collection of vertices and edges which provides connection between input vertices and output vertices by nonintersecting (vertex-disjoint) paths.
In this paper, we consider the problem of designing an efficient oblivious transfer (OT) protocol that is provably secure in a concurrent setting, i.e., where many OT protocols may be running concu
This paper elaborates on Conditional Handover (CHO) modelling, aimed at maximizing the use of contention free random access (CFRA) during mobility.
The Border Gateway Protocol (BGP) is the standard protocol for exchanging routing information between border routers of Autonomous Systems (ASes) in today's Internet.
This paper considers a class of constant-amplitude digital modulation schemes with smoothed partial-response, continuous-phase modulation.
Today the Internet network consists of diverse layers and entities with overlapping functionalities and limited interworking capabilities.
