Results 61 to 70 of about 113,006 (300)
On Nearly Perfect Covering Codes
IEEE Transactions on Information TheoryNearly perfect packing codes are those codes that meet the Johnson upper bound on the size of error-correcting codes. This bound is an improvement to the sphere-packing bound. A related bound for covering codes is known as the van Wee bound. Codes that meet this bound will be called nearly perfect covering codes. In this paper, such codes with covering
Avital Boruchovsky +2 more
openaire +3 more sources
Perfect binary codes: classification and properties [PDF]
, 2009 An r-perfect binary code is a subset of ℤ2n such that for any word, there is a unique codeword at Hamming distance at most r. Such a code is r-error-correcting.
Pottonen, Olli
core
Weighted Posets and Digraphs Admitting the Extended Hamming Code to be a Perfect Code
, 2019 Recently, Etzion et al. introduced metrics on F-2(n) based on directed graphs on n vertices and developed some basic coding theory on directed graph metric spaces.
Park, J.R., Kim, H.K., Hyun, J.Y.
core +1 more source
Multimodal Data‐Driven Microstructure Characterization
Advanced Engineering Materials, EarlyView.A self‐consistent autonomous workflow for EBSP‐based microstructure segmentation by integrating PCA, GMM clustering, and cNMF with information‐theoretic parameter selection, requiring no user input. An optimal ROI size related to characteristic grain size is identified.
Qi Zhang +4 more
wiley +1 more source
A Dislocation Perspective on Strength and Toughness in Ceramics
Advanced Engineering Materials, EarlyView.Dislocations in ceramics enjoy a long but yet under‐appreciated history. The three research waves for dislocations in ceramics highlight the topic evolution over the last 90 years. This review focuses on the impact of dislocation on strength and toughness in ceramics.
Xufei Fang
wiley +1 more source
Capacity Allocations in Multi-cell UMTS Networks for Different Spreading Factors with Perfect and Imperfect Power Control [Presentation] [PDF]
, 2006 This presentation discusses user and interference models, wideband code division multiple access (WCDMA) capacity with perfect and imperfect power control, and spreading factors with numerical ...
Akl, Robert G., Nguyen, Son
core
Byte protecting perfect burst code
, 2017 Byte correcting perfect codes are developed to correct burst errors within bytes. If a code is byte correcting code and we say that the code is [Formula: see text]-burst correcting, meaning that it corrects a single burst of length [Formula: see text ...
Ambika Tyagi, Vinod Tyagi
core +1 more source
Laser‐Induced Graphene from Waste Almond Shells
Advanced Functional Materials, EarlyView.Almond shells, an abundant agricultural by‐product, are repurposed to create a fully bioderived almond shell/chitosan composite (ASC) degradable in soil. ASC is converted into laser‐induced graphene (LIG) by laser scribing and proposed as a substrate for transient electronics.
Yulia Steksova +9 more
wiley +1 more source
Une propriété pragmatique du past perfect
Corela, 2007 This paper puts forward a new analysis of the past perfect structure. The careful study of various utterances reveals that it can have a clearly pragmatic scope.
Emmanuelle Roussel
doaj +1 more source
Scalable Surface-Code Decoders with Parallelization in Time
PRX Quantum, 2023 Fast classical processing is essential for most quantum fault-tolerance architectures. We introduce a sliding-window decoding scheme that provides fast classical processing for the surface code through parallelism.
Xinyu Tan +4 more
doaj +1 more source