Results 61 to 70 of about 59,107 (223)
Efficient One-Time Signatures from Quasi-Cyclic Codes: A Full Treatment
Cryptography, 2018 The design of a practical code-based signature scheme is an open problem in post-quantum cryptography. This paper is the full version of a work appeared at SIN’18 as a short paper, which introduced a simple and efficient one-time secure signature ...
Edoardo Persichetti
doaj +1 more source
Decoding of Quasi-Cyclic Codes up to A New Lower Bound on the Minimum Distance
, 2014 A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite fields is proposed. It is based on spectral analysis and generalizes the Semenov- Trifonov bound in a similar way as the Hartmann-Tzeng bound extends the BCH ...
Ling, San, Zeh, Alexander
core +2 more sources
Unlocking Photodetection Mode Switching from a Simple Lateral Design
Advanced Functional Materials, EarlyView.A simple lateral 2D perovskite photodetector capable of switching among transient, continuous, and dual transient/continuous photoresponse modes is achieved by integrating photoconductive effects with capacitive coupling from the SiO2/Si substrate. Such light‐programmable photodetection mode switching enables triple‐channel information transmission and
Zijun (June) Yong +10 more
wiley +1 more source
Multiuser cyclic shift keying spread spectrum underwater acoustic communication
Tongxin xuebao, 2017 Aiming at the problem of low data rate and high receiver complexity of existing direct sequence spread spectrum code division multiple access (DS-CDMA),a novel code division multiple access (CDMA) using cyclic shift keying (CSK) signaling,namely CSK-CDMA,
Cheng-bing HE +6 more
doaj +2 more sources
Generalized LDPC Codes for Ultra Reliable Low Latency Communication in 5G and Beyond
IEEE Access, 2018 Generalized low-density parity-check (GLDPC) codes, where single parity-check constraints on the code bits are replaced with generalized constraints (an arbitrary linear code), are a promising class of codes for low-latency communication.
Yanfang Liu +2 more
doaj +1 more source
Folding Alternant and Goppa Codes with Non-Trivial Automorphism Groups [PDF]
, 2014 The main practical limitation of the McEliece public-key encryption scheme is probably the size of its key. A famous trend to overcome this issue is to focus on subclasses of alternant/Goppa codes with a non trivial automorphism group. Such codes display
de Portzamparc, Frédéric +4 more
core +2 more sources
Global-scale wreath-building dynamos in stellar convection zones
, 2010 When stars like our Sun are young they rotate rapidly and are very magnetically active. We explore dynamo action in rapidly rotating suns with the 3-D MHD anelastic spherical harmonic (ASH) code.
Allan Sacha Brun +5 more
core +1 more source
Quasi-cyclic codes with cyclic constituent codes
Finite Fields and Their Applications, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Formation of Quasi‐Decoupling Interface on Li‐Metal Anodes in High Donor Electrolyte
Advanced Functional Materials, EarlyView.Li‐metal anode (LMA) is stabilized by introducing Li2Te2 as an electrolyte additive for Li‐metal batteries. Upon contact with Li, Li2Te2 spontaneously converts to Li2Te, which electronically isolates Li from dimethyl sulfoxide due to its large bandgap and minimal Bader charge transfer.
Hyerim Kim +9 more
wiley +1 more source
Algebraic lower bounds on the free distance of convolutional codes [PDF]
, 2005 A new module structure for convolutional codes is introduced and used to establish further links with quasi-cyclic and cyclic codes. The set of finite weight codewords of an (n,k) convolutional code over Fq is shown to be isomorphic to an Fq[x]-submodule
Lally, K
core