scientific article
From MaRDI portal
Publication:3293678
zbMath0107.11802MaRDI QIDQ3293678
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
New near shannon limit codes: Zigzag codes and concatenated zigzag codes, Fourth moments of the code-weights, A REDUCTION IN THE SEARCH SPACE OF QC-LDPC CODES WITH GIRTH 8, Soft decoding of short/medium length codes using ordered statistics for quantum key distribution, Spectral gap in random bipartite biregular graphs and applications, Well-mixing vertices and almost expanders, About Low DFR for QC-MDPC Decoding, QC-MDPC Decoders with Several Shades of Gray, Geometric Constructions of Gallager Codes, Basics of Secrecy Coding, Unnamed Item, Graphical Models and Message-Passing Algorithms: Some Introductory Lectures, Unnamed Item, A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes, Recent Developments in Low-Density Parity-Check Codes, Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders, Unnamed Item, Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks, Some Aspects of Information Theory in Gambling and Economics, On some punctured codes of ℤq-Simplex codes, Security enhancement method using shortened error correcting codes, A Practical Fuzzy Extractor for Continuous Features, An integer parallelotope with small surface area, Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error, A general construction of regular complete permutation polynomials, Two classes of LDPC codes from the space of Hermitian matrices over finite fields, Extremal absorbing sets in low-density parity-check codes, A Friendly Tutorial on Mean-Field Spin Glass Techniques for Non-Physicists, Probabilistic Amplitude Shaping, Verifiable quantum secret sharing scheme based on LDPC codes, Does the dual-sieve attack on learning with errors even work?, Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks, Theory behind quantum error correcting codes: an overview, Channel polarization of two-dimensional-input quantum symmetric channels, Super-simple \((v, 5, 2)\) directed designs and their smallest defining sets with application in LDPC codes, How to recover a secret with \(O(n)\) additions, Expander graphs and their applications, Good codes based on very sparse matrices, Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs, On Resolving Simultaneous Congruences Using Belief Propagation, Unnamed Item, Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation, (7,K) GIRTH-8 QC-LDPC CODES WITH AN EXPLICIT CONSTRUCTION, Inferring Sparse Preference Lists from Partial Information, Lowering the error floor of Gallager codes: a statistical-mechanical view, ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES, LDPC Codes Based on Algebraic Graphs, Unnamed Item, Unnamed Item, Detection and recognition of a binary linear code, Limitation on the Rate of Families of Locally Testable Codes, Codes on graphs: Recent progress, Statistical mechanics and capacity-approaching error-correcting codes, Variations on the Gallager bounds with some applications, Iterative decoding of LDPC codes: some bounds and properties, Unnamed Item, Theory and applications of Raptor codes, An Improved Rao–Nam Cryptosystem Based on Fractional Order Hyperchaotic System and EDF–QC–LDPC, Differential Power Analysis of a McEliece Cryptosystem, Conics arising from external points and their binary codes, Small weight codewords in the LDPC codes arising from linear representations of geometries, Recursive construction of $(J,L)$ QC LDPC codes with girth 6, Masking Large Keys in Hardware: A Masked Implementation of McEliece, Новые методы исправления ошибок в квантовой криптографии с использованием LDPC-кодов, Geometrical organization of solutions to random linear Boolean equations, Photonic circuits for iterative decoding of a class of low-density parity-check codes, Fine-Grained Cryptography, A New Approach to Laplacian Solvers and Flow Problems, Discrete optimisation and fast correlation attacks, Quantum Codes from High-Dimensional Manifolds, Gallager error-correcting codes for binary asymmetric channels, The non-backtracking spectrum of the universal cover of a graph, Gauging variational inference, Gauges, loops, and polynomials for partition functions of graphical models, Tractable minor-free generalization of planar zero-field Ising models, Stopping sets of codes from complete graph, Low-Density Parity-Check Codes Achieve List-Decoding Capacity, ON THE CLASS OF ARRAY-BASED APM-LDPC CODES, On encoding symbol degrees of array BP-XOR codes, On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes, Minimum distances of three families of low-density parity-check codes based on finite geometries, Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes, Novel multiparty controlled bidirectional quantum secure direct communication based on continuous-variable states, Reliable computation with cellular automata, An explicit method to generate some QC LDPC codes with girth 8, Correlations between the ranks of submatrices and weights of random codes, A survey on fast correlation attacks, Linear-time list recovery of high-rate expander codes, Conics arising from internal points and their binary codes, A family of low density matrices in Lagrangian-Grassmannian, Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles, LDPC codes from the Hermitian curve, Information storage capacity of discrete spin systems, Analysis on crossover probability estimation using LDPC syndrome, A class of quantum low-density parity check codes by combining seed graphs, Tutorial series on brain-inspired computing. V: Statistical mechanics of communication and computation, Unnamed Item, On randomly chosen arrangements of \(q+1\) lines with different slopes in \(\mathbb{F}_q^2\), Characterizing the performance of wireless communication architectures via basic Diophantine approximation bounds, Fast correlation attacks on certain stream ciphers, On the stopping distance of LDPC codes based on symplectic space over finite fields, New constructions of involutions over finite fields, Two-layer contractive encodings for learning stable nonlinear features, Measure-resend authenticated semi-quantum key distribution with single photons, Design of efficiently encodable nonbinary LDPC codes for adaptive coded modulation, Improved construction of LDPC convolutional codes with semi-random parity-check matrices, Constructions of QC LDPC codes based on integer sequences, On tensor products of CSS codes, Comprehensive high-speed reconciliation for continuous-variable quantum key distribution, A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting, Monotonic optimization based decoding for linear codes, Learning a tree-structured Ising model in order to make predictions, Exact recording of Metropolis-Hastings-class Monte Carlo simulations using one bit per sample, Moments of the support weight distribution of linear codes, A new construction for involutions over finite fields, Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks, Large weight code words in projective space codes, Cryptanalysis of a code-based one-time signature, On the girth of voltage graph lifts, An iterative algorithm and low complexity hardware architecture for fast acquisition of long PN codes in UWB systems, Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting), On the search of smallest QC-LDPC code with girth six and eight, Regularized Gaussian belief propagation, Parallel versus sequential updating for belief propagation decoding, Solving sparse linear systems of equations over finite fields using bit-flipping algorithm, A library for formalization of linear error-correcting codes, More constructions of \(n\)-cycle permutations, On LDPC codes corresponding to affine parts of generalized polygons, Codes of Desarguesian projective planes of even order, projective triads and \((q+t,t)\)-arcs of type \((0, 2, t)\), On analyzing LDPC codes over multiantenna MC-CDMA system, Regular LDPC codes from semipartial geometries, Analysis of error-correcting codes for lattice-based key exchange, Identifying an unknown code by partial Gaussian elimination, Quantum graphical models and belief propagation, Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering, Construction of LDPC convolutional codes via difference triangle sets, Investigation of commuting Hamiltonian in quantum Markov network, An improved multidimensional reconciliation algorithm for continuous-variable quantum key distribution, Composition of semi-LTCs by two-wise tensor products, LDPC codes from \(\mu\)-geodetic graphs obtained from block designs, Symmetric blind information reconciliation and hash-function-based verification for quantum key distribution, Data association based on optimization in graphical models with application to sensor networks, Efficient three-party quantum dialogue protocol based on the continuous variable GHZ states, A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices, Hierarchical erasure correction of linear codes, A new approach to constructing CSS codes based on factor graphs, Convergence and correctness of belief propagation for the Chinese postman problem, Higher weights for the Lagrangian-Grassmannian codes, Multiple accumulated-crossover parallel concatenated SPC codes, Some low-density parity-check codes derived from finite geometries, A performance analysis of quantum low-density parity-check codes for correcting correlated errors, Channel decomposition for multilevel codes over multilevel and partial erasure channels, Understanding the scalability of Bayesian network inference using clique tree growth curves, LDPC based time-frequency double differential space-time coding for multi-antenna OFDM systems, On the constructions of \(n\)-cycle permutations, Skew constacyclic codes over finite fields and finite chain rings, Cospectral bipartite graphs with the same degree sequences but with different number of large cycles, Finding most likely solutions, On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right\) shortened Hamming codes and their dual-codes], High-throughput architectures for circular block-type low-density parity-check codes, On the homogeneous algebraic graphs of large girth and their applications, Convergence of a belief propagation algorithm for biological networks, Codes on linear sections of the Grassmannian, A branch-cut-and-price algorithm for optimal decoding in digital communication systems, Bit-optimal decoding of codes whose Tanner graphs are trees, Linear representations of finite geometries and associated LDPC codes, Promising performance of PA-coded SIMO FM-DCSK communication systems, The dimensions of \(LU(3,q)\) codes, Pruning processes and a new characterization of convex geometries, LDPC codes from Singer cycles, Analysis of Termatiko sets in measurement matrices, New constructions of quantum stabilizer codes based on difference sets, Moderate-density parity-check codes from projective bundles, Local correctability of expander codes, High efficiency postprocessing for continuous-variable quantum key distribution: using all raw keys for parameter estimation and key extraction, High-rate LDPC codes from partially balanced incomplete block designs, Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes, Belief propagation as diffusion
