◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

B. Butler

7 papers hereh-index 8260 citations47 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author6

Across the 7 of 7 papers where every author was matched, so the position is known.

fields
  • cs.IT6
  • math.CO1
same name
  • B. Butler — 93 papers
  • B. Butler — 50 papers, h 36
  • B. Butler — 24 papers
  • B. Butler — 13 papers, h 6
  • B. Butler — 5 papers, h 71
  • B. Butler — 4 papers, h 8

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20102016
most citedOn Distance Properties of Quasi-Cyclic Protograph-Based LDPC Codes

16 citations · 41 across the 7 of their papers we have counts for

collaborators
Showing 2012Show all

4 papers · 1 filter

cs.IT2012

Numerical Issues Affecting LDPC Error Floors

Brian K. Butler, Paul H. Siegel

Numerical issues related to the occurrence of error floors in floating-point simulations of belief propagation (BP) decoders are examined. Careful processing of messages correspond…

math.CO2012★ 15 cited

Generalized Sharp Bounds on the Spectral Radius of Digraphs

Brian K. Butler, Paul H. Siegel

The spectral radius ρ(G) of a digraph G is the maximum modulus of the eigenvalues of its adjacency matrix. We present bounds on ρ(G) that are often tighter and are applicable to a…

cs.IT2012★ 3 cited

Error Floor Approximation for LDPC Codes in the AWGN Channel

Brian K. Butler, Paul H. Siegel

This paper addresses the prediction of error floors of low-density parity-check (LDPC) codes with variable nodes of constant degree in the additive white Gaussian noise (AWGN) chan…

cs.IT2012★ 1 cited

Bounds on the Minimum Distance of Punctured Quasi-Cyclic LDPC Codes

Brian K. Butler, Paul H. Siegel

Recent work by Divsalar et al. has shown that properly designed protograph-based low-density parity-check (LDPC) codes typically have minimum (Hamming) distance linearly increasing…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.