Results 71 to 80 of about 178,221 (275)

Transformation of Binary Linear Block Codes to Polar Codes With Dynamic Frozen

open access: yesIEEE Open Journal of the Communications Society, 2020
In this paper, a general transformation of binary linear block codes (BLBCs) to (possibly, multi-kernel) polar codes with dynamic frozen bits is proposed.
Chien-Ying Lin   +3 more
doaj   +1 more source

Intelligent Path-Selection-Aided Decoding of Polar Codes

open access: yesEntropy, 2023
CRC-aided successive cancellation list (CA-SCL) decoding is a powerful algorithm that dramatically improves the error performance of polar codes. Path selection is a major issue that affects the decoding latency of SCL decoders. Generally, path selection
Hongji Cui, Kai Niu, Shunfu Zhong
doaj   +1 more source

Some remarks on multiplicity codes

open access: yes, 2014
Multiplicity codes are algebraic error-correcting codes generalizing classical polynomial evaluation codes, and are based on evaluating polynomials and their derivatives.
Kopparty, Swastik
core   +1 more source

Artificial Intelligence‐based Online Symptom Assessment Tools for Systemic Lupus Erythematosus (SLE) diagnosis: Patient Perspectives

open access: yesArthritis Care &Research, Accepted Article.
Objective The objective of this article is to identify perceptions of SLE patients regarding artificial intelligence (AI)‐based online symptom assessment tools, and the potential of these tools to address diagnostic barriers. Methods Adults from our SLE research cohort were invited to participate in 60‐90 minute virtual focus groups concerning their ...
Olivia A. Stein   +7 more
wiley   +1 more source

List and Unique Error-Erasure Decoding of Interleaved Gabidulin Codes with Interpolation Techniques

open access: yes, 2014
A new interpolation-based decoding principle for interleaved Gabidulin codes is presented. The approach consists of two steps: First, a multi-variate linearized polynomial is constructed which interpolates the coefficients of the received word and second,
Wachter-Zeh, Antonia, Zeh, Alexander
core   +3 more sources

What Do Large Language Models Know About Materials?

open access: yesAdvanced Engineering Materials, EarlyView.
If large language models (LLMs) are to be used inside the material discovery and engineering process, they must be benchmarked for the accurateness of intrinsic material knowledge. The current work introduces 1) a reasoning process through the processing–structure–property–performance chain and 2) a tool for benchmarking knowledge of LLMs concerning ...
Adrian Ehrenhofer   +2 more
wiley   +1 more source

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

open access: yesTongxin 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

Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows

open access: yesAdvanced Engineering Materials, EarlyView.
A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba   +5 more
wiley   +1 more source

General Linearized Polynomial Interpolation and Its Applications

open access: yes, 2011
In this paper, we first propose a general interpolation algorithm in a free module of a linearized polynomial ring, and then apply this algorithm to decode several important families of codes, Gabidulin codes, KK codes and MV codes.
Suter, Bruce W.   +2 more
core   +1 more source

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

open access: yesIEEE 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   +2 more sources

Home - About - Disclaimer - Privacy