Publication

On degraded two-message set broadcast

Related concepts (26)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Split exact sequence

In mathematics, a split exact sequence is a short exact sequence in which the middle term is built out of the two outer terms in the simplest possible way. A short exact sequence of abelian groups or of modules over a fixed ring, or more generally of objects in an is called split exact if it is isomorphic to the exact sequence where the middle term is the direct sum of the outer ones: The requirement that the sequence is isomorphic means that there is an isomorphism such that the composite is the natural inclusion and such that the composite equals b.

Pure submodule

In mathematics, especially in the field of module theory, the concept of pure submodule provides a generalization of direct summand, a type of particularly well-behaved piece of a module. Pure modules are complementary to flat modules and generalize Prüfer's notion of pure subgroups. While flat modules are those modules which leave short exact sequences exact after tensoring, a pure submodule defines a short exact sequence (known as a pure exact sequence) that remains exact after tensoring with any module.

Flat module

In algebra, flat modules include free modules, projective modules, and, over a principal ideal domain, torsion free modules. Formally, a module M over a ring R is flat if taking the tensor product over R with M preserves exact sequences. A module is faithfully flat if taking the tensor product with a sequence produces an exact sequence if and only if the original sequence is exact. Flatness was introduced by in his paper Géometrie Algébrique et Géométrie Analytique.

Projective module

In mathematics, particularly in algebra, the class of projective modules enlarges the class of free modules (that is, modules with basis vectors) over a ring, by keeping some of the main properties of free modules. Various equivalent characterizations of these modules appear below. Every free module is a projective module, but the converse fails to hold over some rings, such as Dedekind rings that are not principal ideal domains.

Private message

In computing, a private message, personal message, or direct message (abbreviated as PM or DM) refers to a private communication sent or received by a user of a private communication channel on any given platform. Unlike public posts, PMs are only viewable by the participants. Though long a function present on IRCs and Internet forums, private channels for PMs have recently grown in popularity due to the increasing demand for privacy and private collaboration on social media. There are two main types of private messages.

Automatic transmission

An automatic transmission (sometimes abbreviated AT) is a multi-speed transmission used in motor vehicles that does not require any input from the driver to change forward gears under normal driving conditions. The most common type of automatic transmission is the hydraulic automatic, which uses a planetary gearset, hydraulic controls, and a torque converter. Other types of automatic transmissions include continuously variable transmissions (CVT), automated manual transmissions (AMT), and dual-clutch transmissions (DCT).

Message-oriented middleware

Message-oriented middleware (MOM) is software or hardware infrastructure supporting sending and receiving messages between distributed systems. MOM allows application modules to be distributed over heterogeneous platforms and reduces the complexity of developing applications that span multiple operating systems and network protocols. The middleware creates a distributed communications layer that insulates the application developer from the details of the various operating systems and network interfaces.

Message authentication code

In cryptography, a message authentication code (MAC), sometimes known as an authentication tag, is a short piece of information used for authenticating a message. In other words, to confirm that the message came from the stated sender (its authenticity) and has not been changed. The MAC value protects a message's data integrity, as well as its authenticity, by allowing verifiers (who also possess the secret key) to detect any changes to the message content.

User Datagram Protocol

In computer networking, the User Datagram Protocol (UDP) is one of the core communication protocols of the Internet protocol suite used to send messages (transported as datagrams in packets) to other hosts on an Internet Protocol (IP) network. Within an IP network, UDP does not require prior communication to set up communication channels or data paths. UDP uses a simple connectionless communication model with a minimum of protocol mechanisms.

Linear predictive coding

Linear predictive coding (LPC) is a method used mostly in audio signal processing and speech processing for representing the spectral envelope of a digital signal of speech in compressed form, using the information of a linear predictive model. LPC is the most widely used method in speech coding and speech synthesis. It is a powerful speech analysis technique, and a useful method for encoding good quality speech at a low bit rate.