Results 81 to 90 of about 19,174 (291)

Simplified MD-LSD demapping algorithm for BICM-ID systems with multi-dimensional mappings

Tongxin xuebao, 2008
The soft in soft out MAX-LOG-MAP algorithm of conventional mappings was expanded to the BICM-ID sys- tem with multi-dimensional mappings. A multi-dimensional list sphere decoding （MD-LSD） algorithm was also proposed by using the list sphere decoding ...
GONG Feng-kui, GE Jian-hua, WANG Yong
doaj   +2 more sources

Successive Cancellation Priority Decoding of Polar Codes

IEEE Access, 2019
The successive cancellation list (SCL) decoding of polar codes can achieve a performance close to that of maximum-likelihood decoding. Nevertheless, a large list size results in high-computational complexity.
Di Guan, Kai Niu, Chao Dong, Ping Zhang
doaj   +1 more source

Ultra‐High‐Throughput Discovery of Multifunctional Polyphenolic Coatings on Droplet Microarrays

Advanced Materials, EarlyView.
An ultra‐high‐throughput (UHT) combinatorial strategy enables the miniaturized synthesis and screening of ≈30 000 polyamine‐polyphenolic (PaPp) coatings using droplet microarrays (DMA). This approach reveals hundreds of previously unknown fluorescent, redox‐active, and antibacterial materials, including multifunctional, cell‐compatible surfaces ...
Vania Tanda Widyaya, Joaquín E. Urrutia Gómez, Paul Reuß, Alexander Welle, Rolf A. Gattung, Jana Mayer, Peter Krolla, Markus Reischl, Pascal Friederich, Anna A. Popova, Thomas Schwartz, Pavel A. Levkin   +11 more
wiley   +1 more source

From Behavior to Dynamics: Decoding Carrier Roles in Cu‐based Photocathodes for Solar‐Driven CO2 Reduction

Advanced Materials, EarlyView.
The performance of Cu‐based photocathodes in photoelectrochemical CO2 reduction is not governed by catalytic sites alone, but by the dynamic journey of photogenerated carriers. This review decodes how carrier generation, recombination, transport, accumulation, extraction, and electrolyte coupling shape catalytic activity, selectivity, and stability ...
Yi‐Cheng Wang, Chenyu Xu, Peng‐Fei Sui, Yi Liu, Xiaolei Wang, Jing‐Li Luo   +5 more
wiley   +1 more source

Binary List Decoding Beyond Covering Radius

, 2014
Wu’s list decoding algorithm, when restricted to binary codes, allows decoding up to the binary Johnson bound. Unfortunately, in the vast majority of cases, this bound is not capable to reach the covering radius R of the code, and this implies that some
Francesco Fabris, FABRIS, FRANCESCO, BARDELLOTTO, ERIKA, Erika Bardellotto   +3 more
core   +1 more source

End‐to‐End Sensing Systems for Breast Cancer: From Wearables for Early Detection to Lab‐Based Diagnosis Chips

Advanced Materials Technologies, EarlyView.
This review explores advances in wearable and lab‐on‐chip technologies for breast cancer detection. Covering tactile, thermal, ultrasound, microwave, electrical impedance tomography, electrochemical, microelectromechanical, and optical systems, it highlights innovations in flexible electronics, nanomaterials, and machine learning.
Neshika Wijewardhane, Lyn I. Jones, Richard M. Martin, Helen Winter, Faezeh Arab Hassani   +4 more
wiley   +1 more source

A Lower Bound on List Size for List Decoding [PDF]

IEEE Transactions on Information Theory, 2005
A q-ary error-correcting code C⊆{1,2,...,q}n is said to be list decodable to radius ρ with list size L if every Hamming ball of radius ρ contains at most L codewords of C. We prove that in order for a q-ary code to be list-decodable up to radius (1–1/q)(1–e)n, we must have L = Ω(1/e2).
Guruswami, Venkatesan, Vadhan, Salil
openaire   +3 more sources

Information Transmission Strategies for Self‐Organized Robotic Aggregation

Advanced Robotics Research, EarlyView.
In this review, we discuss how information transmission influences the neighbor‐based self‐organized aggregation of swarm robots. We focus specifically on local interactions regarding information transfer and categorize previous studies based on the functions of the information exchanged.
Shu Leng, Zihan Li, Yifeng Shao, Jinhao Liu, Li Yu, Shuguang Li   +5 more
wiley   +1 more source

List Decoding Barnes-Wall Lattices [PDF]

2012 IEEE 27th Conference on Computational Complexity, 2012
The question of list decoding error-correcting codes over finite fields (under the Hamming metric) has been widely studied in recent years. Motivated by the similar discrete structure of linear codes and point lattices in R^N, and their many shared applications across complexity theory, cryptography, and coding theory, we initiate the study of list ...
Elena Grigorescu, Chris Peikert
openaire   +4 more sources

Improving the Robustness of Visual Teach‐and‐Repeat Navigation Using Drift Error Correction and Event‐Based Vision for Low‐Light Environments

Advanced Robotics Research, EarlyView.
Visual teach‐and‐repeat (VTR) navigation allows robots to learn and follow routes without building a full metric map. We show that navigation accuracy for VTR can be improved by integrating a topological map with error‐drift correction based on stereo vision.
Fuhai Ling, Ze Huang, Tony J. Prescott
wiley   +1 more source