Abstract: Described is a decoder suitable for use with any communication or storage system. The described decoder has a modular decoder hardware architecture capable of implementing a noise guessing process and due to its dependency only on noise, the decoder design is independent of any encoder, thus making it a universal decoder. Hence, the decoder architecture described herein is agnostic to any coding scheme.

Abstract: Described are concepts, systems, devices and methods that enhance decoding performance of channels subject to correlated noise. The concepts, systems, devices and methods can be used with any combination of codes, code-rates and decoding techniques. In embodiments, a continuous realization of effective noise is estimated from a lead channel by subtracting its decoded output from its received signal. This estimate is then used to improve the accuracy of decoding of an otherwise orthogonal channel that is experiencing correlated effective noise. In this approach, channels aid each other through the post-decoding provision of estimates of effective noise. In some embodiments, the lead channel is not pre-determined, but is chosen dynamically based on which of a plurality of decoders completes first, or using soft information including an estimate of effective noise that is least energetic or most likely to have occurred.

Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.

Abstract: The present application concerns an iterative bit-flipping decoding method using symbol or bit reliabilities, which is a variation of GRAND decoding and is denoted by ordered reliability bits GRAND (ORBGRAND). It comprises receiving a plurality of demodulated symbols from a noisy transmission channel; and receiving for the plurality of demodulated symbols, information indicating a ranked order of reliability of at least the most unreliable information contained within the plurality of demodulated symbols. A sequence of putative noise patterns from a most likely pattern of noise affecting the plurality of symbols through one or more successively less likely noise patterns is provided.

Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.

Abstract: Described are concepts, systems, devices and methods that enhance decoding performance of channels subject to correlated noise. The concepts, systems, devices and methods can be used with any combination of codes, code-rates and decoding techniques. In embodiments, a continuous realization of effective noise is estimated from a lead channel by subtracting its decoded output from its received signal. This estimate is then used to improve the accuracy of decoding of an otherwise orthogonal channel that is experiencing correlated effective noise. In this approach, channels aid each other through the post-decoding provision of estimates of effective noise. In some embodiments, the lead channel is not pre-determined, but is chosen dynamically based on which of a plurality of decoders completes first, or using soft information including an estimate of effective noise that is least energetic or most likely to have occurred.

Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.

Abstract: Described are concepts, systems, devices and methods that enhance decoding performance of channels subject to correlated noise. The concepts, systems, devices and methods can be used with any combination of codes, code-rates and decoding techniques. In embodiments, a continuous realization of effective noise is estimated from a lead channel by subtracting its decoded output from its received signal. This estimate is then used to improve the accuracy of decoding of an otherwise orthogonal channel that is experiencing correlated effective noise. In this approach, channels aid each other through the post-decoding provision of estimates of effective noise. In some embodiments, the lead channel is not pre-determined, but is chosen dynamically based on which of a plurality of decoders completes first, or using soft information including an estimate of effective noise that is least energetic or most likely to have occurred.

Abstract: An augmented connection graph can be created based on a task to be performed by a fog computing node by augmenting a connection graph representing plurality of IoT devices and connections among them. The augmenting can include adding to the connection graph data type nodes representing types of data processed by the fog computing node and adding connections between the data type nodes and IoT devices that generate the type of data represented by the respective data type nodes. A connection can be added between each pair of the IoT devices that are not currently connected and for which a level of correlation between the pair of IoT devices at least equals a threshold value. Based on the augmented connection graph, at least one of the IoT devices to assign to the fog computing node can be determined and assigned to the fog computing node.

Abstract: Disclosed is a method of reducing the Instantaneous to Average Power Ratio, IAR, of a transmitter system, comprising the steps of: receiving an input digital signal comprising a plurality of samples; extracting magnitude information for each of the plurality of samples; selecting a plurality of samples whose magnitude exceeds a predefined threshold; sorting, by magnitude, the selected plurality of samples; selecting from the sorted plurality of samples, only those samples having a spacing more than a first pre-defined spacing and filtering those samples, using an FIR filter; subtracting the output of the FIR filter from a delayed version of the input digital signal to produce an output signal.

Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.

Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. In various embodiments, soft information is used to generate a symbol mask that identifies the collection of symbols that are suspected to differ from the channel input, and only these are subject to guessing. This decoder embodies or approximates maximum likelihood (optionally with soft information) decoding for any code. In some embodiments, the decoder tests abounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted.

Abstract: Provided is a method for correcting errors in a data transmission network, comprising: transmitting a plurality of uncoded information packets across a network path; transmitting a plurality of coded packets for recovering information packets lost in transmission across said network path, the coded packets being temporally interspersed among said uncoded information packets, wherein the coded packets are encoded based on information packets transmitted prior to a previously transmitted coded packet; and determining the interspersion of the coded packets according to a packet loss rate.

Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.

Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.

Abstract: A method is disclosed for transmitting data between a source node and destination node connected via multiple paths of a heterogeneous network, at least one of the paths delivering packets with a non-deterministic delivery time. Data is divided into frames, each frame comprising a number of packets, where processing by the destination node of an information packet p is conditional on receipt of the data for any information packet i where i<p. A number of sequential transmission slots s, each for transmitting a given packet p of a frame, are allocated for each network path k. A set D of possible assignments of packets to transmission slots for a frame are provided. The method comprises determining an assignment x with minimum in-order delivery delay of said packets based on expected arrival times of packets to their destination and expected reordering delay for packets. Packets are then transmitted in accordance with the determined assignment x.

Abstract: The present invention relates to a life attenuated Bordetella pertussis vaccine which is deficient for tracheal cytotoxin (TCT), pertussis toxin (PTX), and dermonecrotic toxin (DNT) for prophylaxis or treatment of an allergen-driven airway pathology.

Abstract: A computer-implemented method, computer program product, and computing system is provided for determining quality of experience for communication sessions. In an implementation, a method may include determining a plurality of intrusive quality of experience scores associated with a plurality of intrusive audio transmission samples. The method may also include determining a plurality of non-intrusive quality of experience scores associated with a plurality of non-intrusive audio transmission samples. The method may further include deriving a quality of experience coefficient based upon a relationship between the plurality of intrusive quality of experience scores and the plurality of non-intrusive quality of experience scores.

Abstract: Secrecy scheme systems and associated methods using list source codes for enabling secure communications in communications networks are provided herein. Additionally, improved information-theoretic metrics for characterizing and optimizing said secrecy scheme systems and associated methods are provided herein. One method of secure communication comprises receiving a data file at a first location, encoding the data file using a list source code to generate an encoded file, encrypting a select portion of the data file using a key to generate an encrypted file, and transmitting the encoded file and the encrypted file to an end user at a destination location, wherein the encoded file cannot be decoded at the destination location until the encrypted file has been received and decrypted by the end user, wherein the end user possesses the key.

Abstract: Provided is a method for correcting errors in a data transmission network, comprising: transmitting a plurality of uncoded information packets across a network path; transmitting a plurality of coded packets for recovering information packets lost in transmission across said network path, the coded packets being temporally interspersed among said uncoded information packets, wherein the coded packets are encoded based on information packets transmitted prior to a previously transmitted coded packet; and determining the interspersion of the coded packets according to a packet loss rate.