Â鶹´«Ã½Ó³»­

Locally recoverable codes (LRCs) with locality parameter r can recover any erased code symbol by accessing r other code symbols. This local recovery property is of great interest in large-scale distributed classical data storage systems as it leads to efficient repair of failed nodes. A well-known class of optimal (classical) LRCs are subcodes of Reed-Solomon codes constructed using a special type of polynomials called good polynomials.

Ambitions for the next generation of wireless communication include high data rates, low latency, ubiquitous access, ensuring sustainability (in terms of consumption of energy and natural resources), all while maintaining a reasonable level of implementation complexity. Achieving these goals necessitates reforms in cellular networks, specifically in the physical layer and antenna design.

Classical coding theory contains several techniques to obtain new codes from other codes, including puncturing and shortening. Both of these techniques have been generalized to quantum codes. Restricting to stabilizer codes, this paper introduces more freedom in the choice of the encoded states after puncturing. Furthermore, we also give an explicit description of the stabilizers for the punctured code.

Subject to the laws of classical physics -the science that governs the design of todays wireless communication systems -there is no need to match the radiation impedance of a receiver antenna to the impedance of the front-end electronics in order to effect communications. If we dispense with a transmission line and, instead, make the front-end electronics colocated with the antenna, then a high input-impedance preamplifier can measure the open-circuit voltage directly on the antenna port while drawing negligible power.

A communication-efficient protocol is introduced over a many-to-one quantum network for Q-E-B-MDS-X-TPIR, i.e., quantum private information retrieval with MDS-X-secure storage and T-private queries. The protocol is resilient to any set of up to E unresponsive servers (erased servers or stragglers) and any set of up to B Byzantine servers. The underlying coding scheme incorporates an enhanced version of a Cross Subspace Alignment (CSA) code, namely a Modified CSA (MCSA) code, into the framework of CSS codes.

In MIMO communications, information about the transmitted signal is conveyed to the receiver through fields and currents on the surface of the receive antenna array. However, this information can only be observed indirectly through the ports of the array. This raises fundamental information-theoretic questions: How much useful information is contained in the fields and currents on the surface of the receiver array? How much of this information is captured by the array ports?