Exact Counting for a Boolean–Modular Equation with Bounded Tap Span

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-27
DOI
https://doi.org/10.5281/zenodo.23697062
Primary Topic
Coding theory and cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Exact Counting for a Boolean–Modular Equation with Bounded Tap Span

lmtlssss🜐
1 links
Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
preprint

Exact Counting for a Boolean–Modular Equation with Bounded Tap Span

lmtlssss🜐
preprint en

Abstract

No abstract available for this paper.
Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Exact Counting for a Boolean–Modular Equation with Bounded Tap Span — lmtlssss🜐 · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS