UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

On the Spark of Binary LDPC Measurement Matrices From Complete Protographs

IEEE signal processing letters, 2017-11, Vol.24 (11), p.1616-1620

2017

Volltextzugriff (PDF)

On the Minimum Distance of Full-Length RS-LDPC Codes

IEEE communications letters, 2015-11, Vol.19 (11), p.1869-1872

2015

Volltextzugriff (PDF)

On the Number of Minimum Stopping Sets and Minimum Codewords of Array LDPC Codes

IEEE communications letters, 2010-07, Vol.14 (7), p.670-672

2010

Volltextzugriff (PDF)

On the Smallest Absorbing Sets of LDPC Codes From Finite Planes

IEEE transactions on information theory, 2012-06, Vol.58 (6), p.4014-4020

2012

Volltextzugriff (PDF)

An Investigation on LP Decoding of Short Binary Linear Codes With the Subgradient Method

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2024-08, Vol.E107.A (8), p.1395-1399, Article 2023EAL2045

2024

Volltextzugriff (PDF)

On the First Separating Redundancy of Array LDPC Codes

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2024-04, Vol.E107.A (4), p.670-674, Article 2023EAL2030

2024

Volltextzugriff (PDF)

More on Incorrigible Sets of Binary Linear Codes

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2023-05, Vol.E106.A (5), p.863-867, Article 2022EAL2054

2023

Volltextzugriff (PDF)

On the Separating Redundancy of Ternary Golay Codes

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2021-03, Vol.E104.A (3), p.650-655

2021

Volltextzugriff (PDF)

Some Results on Incorrigible Sets of Binary Linear Codes

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2021-02, Vol.E104.A (2), p.582-586

2021

Volltextzugriff (PDF)

Further Results on the Separating Redundancy of Binary Linear Codes

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2019-10, Vol.E102.A (10), p.1420-1425

2019

Volltextzugriff (PDF)

On the Minimum Distance of Some Improper Array Codes

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2019-12, Vol.E102.A (12), p.2021-2026

2019

Volltextzugriff (PDF)

Structural Analysis of Nonbinary Cyclic and Quasi-Cyclic LDPC Codes with α-Multiplied Parity-Check Matrices

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2020-11, Vol.E103.A (11), p.1299-1303

2020

Volltextzugriff (PDF)

A note on the paper by K. Feng ``Non-congruent numbers, odd graphs and the Birch–Swinnerton-Dyer conjecture'' (Acta Arith. 75 (1996), 71–83)

Acta arithmetica, 2008, Vol.134 (3), p.279-281

2008

Volltextzugriff (PDF)

On the Separating Redundancy of the Duals of First-Order Generalized Reed-Muller Codes

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2019-01, Vol.E102.A (1), p.310-315

2019

Volltextzugriff (PDF)

Gaussian binomial coefficients modulo cyclotomic polynomials

Journal of number theory, 2016-11, Vol.168, p.154-166

2016

Volltextzugriff (PDF)

On the Second Separating Redundancy of LDPC Codes from Finite Planes

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2018-01, Vol.E101.A (3), p.617-622

2018

Volltextzugriff (PDF)

Further Results on the Minimum and Stopping Distances of Full-Length RS-LDPC Codes

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2017-01, Vol.E100.A (2), p.738-742

2017

Volltextzugriff (PDF)

On the problem σod(n) = σod(n+1)

Filomat, 2019, Vol.33 (2), p.543-559

2019

Volltextzugriff (PDF)

Multistep Linear Programming Approaches for Decoding Low-Density Parity-Check Codes

Tsinghua science and technology, 2009-10, Vol.14 (5), p.556-560

2009

Volltextzugriff (PDF)

On the Elements of the Continued Fractions of Quadratic Irrationals

The Fibonacci quarterly, 2010-05, Vol.48 (2), p.129-136

2010

Volltextzugriff (PDF)

Odd solutions of $\sigma(n)-2n=2$ have at least six distinct prime factors

Publicationes mathematicae (Debrecen), 2013-02, Vol.82 (2), p.255-266

2013

Volltextzugriff (PDF)

Calculating formula and divisibility for relative class numbers of abelian function fields

Journal of number theory, 2009-10, Vol.129 (10), p.2519-2525

2009

Volltextzugriff (PDF)

Upper bound and formula for class numbers of abelian function fields

自然科学进展（英文版）, 2006-03, Vol.16 (3), p.321-323

2006

Volltextzugriff (PDF)

Congruence formulae modulo powers of 2 for class numbers of cyclic quartic fields

Science in China. Series A, Mathematics, physics, astronomy, 2009-03, Vol.52 (3), p.417-126

2009

Volltextzugriff (PDF)

DOUBLE COVERINGS AND UNIT SQUARE PROBLEMS FOR CYCLOTOMIC FIELDS

International journal of number theory, 2011-11, Vol.7 (7), p.1935-1944

2011

Volltextzugriff (PDF)

1 – 25 von 39

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(35)
Mit Volltextzugriff
(22)

Publikationsform

Artikel
(39)

Sprache

Englisch
(38)
Chinesisch
(1)

Erscheinungsjahr

n.n

Thema

Science & Technology
(28)
Technology
(16)
Engineering
(13)
Engineering, Electrical & Electronic
(13)
Computer Science
(12)
Computer Science, Information Systems
(12)
Computer Science, Hardware & Architecture
(11)
Physical Sciences
(9)
Codes
(8)
Mathematics
(7)
Binary System
(6)
Mathematical Analysis
(6)
Upper Bounds
(6)
Decoding
(5)
Error Correcting Codes
(5)
Low-Density Parity-Check Codes
(5)
Redundancy
(5)
Separating Matrix
(5)
Separating Redundancy
(5)
Binary Codes
(4)

15 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 90 Tagen
(2)

Menü

Weitere Dienste

Einstellungen

On the Spark of Binary LDPC Measurement Matrices From Complete Protographs

On the Minimum Distance of Full-Length RS-LDPC Codes

On the Number of Minimum Stopping Sets and Minimum Codewords of Array LDPC Codes

On the Smallest Absorbing Sets of LDPC Codes From Finite Planes

An Investigation on LP Decoding of Short Binary Linear Codes With the Subgradient Method

On the First Separating Redundancy of Array LDPC Codes

More on Incorrigible Sets of Binary Linear Codes

On the Separating Redundancy of Ternary Golay Codes

Some Results on Incorrigible Sets of Binary Linear Codes

Further Results on the Separating Redundancy of Binary Linear Codes

On the Minimum Distance of Some Improper Array Codes

Structural Analysis of Nonbinary Cyclic and Quasi-Cyclic LDPC Codes with α-Multiplied Parity-Check Matrices

A note on the paper by K. Feng ``Non-congruent numbers, odd graphs and the Birch–Swinnerton-Dyer conjecture'' (Acta Arith. 75 (1996), 71–83)

On the Separating Redundancy of the Duals of First-Order Generalized Reed-Muller Codes

Gaussian binomial coefficients modulo cyclotomic polynomials

On the Second Separating Redundancy of LDPC Codes from Finite Planes

Further Results on the Minimum and Stopping Distances of Full-Length RS-LDPC Codes

On the problem σod(n) = σod(n+1)

Multistep Linear Programming Approaches for Decoding Low-Density Parity-Check Codes

On the Elements of the Continued Fractions of Quadratic Irrationals

Odd solutions of $\sigma(n)-2n=2$ have at least six distinct prime factors

Calculating formula and divisibility for relative class numbers of abelian function fields

Upper bound and formula for class numbers of abelian function fields

Congruence formulae modulo powers of 2 for class numbers of cyclic quartic fields

DOUBLE COVERINGS AND UNIT SQUARE PROBLEMS FOR CYCLOTOMIC FIELDS

Suchergebnisse filtern