On the public citation graph

High-order spectral-null codes-constructions and bounds

0 signed · 80 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-68130-1openalex-snapshot
Introduction to Number Theory
inferredcites →https://doi.org/10.1016/0016-0032(60)90676-1openalex-snapshot
An introduction to the theory of numbers
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1090/s0002-9904-1958-10223-2openalex-snapshot
Minimal sets: An introduction to topological dynamics
inferredcites →https://doi.org/10.1090/s0002-9947-1921-1501161-8openalex-snapshot
Recurrent Geodesics on a Surface of Negative Curvature
inferredcites →https://doi.org/10.1109/18.133248openalex-snapshot
On codes satisfying Mth-order running digital sum constraints
inferredcites →https://doi.org/10.1109/18.2610openalex-snapshot
Balancing sets of vectors
inferredcites →https://doi.org/10.1109/18.2613openalex-snapshot
A (16, 9, 6, 5, 4) error-correcting DC free block code
inferredcites →https://doi.org/10.1109/18.32143openalex-snapshot
Codes with a multiple spectral null at zero frequency
inferredcites →https://doi.org/10.1109/18.42227openalex-snapshot
On error-correcting balanced codes
inferredcites →https://doi.org/10.1109/18.52490openalex-snapshot
On balanced codes
inferredcites →https://doi.org/10.1109/18.53755openalex-snapshot
Constructions of error-correcting DC-free block codes
inferredcites →https://doi.org/10.1109/18.79949openalex-snapshot
DC-constrained codes from Hadamard matrices
inferredcites →https://doi.org/10.1109/18.79951openalex-snapshot
Matched spectral-null codes for partial-response channels
inferredcites →https://doi.org/10.1109/18.79961openalex-snapshot
Performance of efficient balanced codes
inferredcites →https://doi.org/10.1109/tit.1973.1054936openalex-snapshot
Polynomial weights and code constructions
inferredcites →https://doi.org/10.1109/tit.1985.1057113openalex-snapshot
On generator matrices of MDS codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1986.1057136openalex-snapshot
Efficient balanced codes
inferredcites →https://doi.org/10.1109/tit.1987.1057296openalex-snapshot
Binary transmission codes with higher order spectral zeros at zero frequency (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1987.1057334openalex-snapshot
On codes with spectral nulls at rational submultiples of the symbol frequency
inferredcites →https://doi.org/10.1109/tmag.1984.1063328openalex-snapshot
Lower bounds on the minimum hamming distance achievable with runlengh constrained or DC free block codes and the synthesis of a (16,8) Dmin= 4 DC free block code
inferredcites →https://doi.org/10.1112/blms/2.3.373bopenalex-snapshot
DIOPHANTINE EQUATIONS
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
inferredcites →https://doi.org/10.2307/2311171openalex-snapshot
An Introduction to the Theory of Numbers.
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.5860/choice.46-6857openalex-snapshot
Introduction to number theory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-57843-9_15openalex-snapshot
Spectral-null codes and null spaces of Hadamard submatrices
inferred← citeshttps://doi.org/10.1007/bf00124592openalex-snapshot
Spectral-null codes and null spaces of Hadamard submatrices
inferred← citeshttps://doi.org/10.1016/b978-0-44-313517-0.00012-3openalex-snapshot
Classification of sequences
inferred← citeshttps://doi.org/10.1023/a:1018018114369openalex-snapshot
Spectral-Null Codes and Null Spaces of Hadamard Submatrices
inferred← citeshttps://doi.org/10.1023/a:1019947222243openalex-snapshot
Self-Complementary Balanced Codes and Quasi-Symmetric Designs
inferred← citeshttps://doi.org/10.1049/el.2015.3933openalex-snapshot
Low‐complexity near‐optimal detection of dc 2 ‐balanced codes
inferred← citeshttps://doi.org/10.1049/iet-rsn.2015.0569openalex-snapshot
Doppler tolerance, complementary code sets, and generalised Thue–Morse sequences
inferred← citeshttps://doi.org/10.1080/09720529.2005.10698052openalex-snapshot
Combinatorial properties of balanced codes over the complexm-th roots of unity and efficient coding algorithms
inferred← citeshttps://doi.org/10.1080/09720529.2005.10698053openalex-snapshot
On efficient high-order spectral-null codes over them-ary alphabet
inferred← citeshttps://doi.org/10.1090/s0025-5718-06-01848-5openalex-snapshot
Littlewood polynomials with high order zeros
inferred← citeshttps://doi.org/10.1090/s0025-5718-08-02072-3openalex-snapshot
Equal moments division of a set
inferred← citeshttps://doi.org/10.1090/s0025-5718-97-00892-2openalex-snapshot
On a problem of Byrnes concerning polynomials with restricted coefficients
inferred← citeshttps://doi.org/10.1109/12.795122openalex-snapshot
Balanced codes with parallel encoding and decoding
inferred← citeshttps://doi.org/10.1109/18.476329openalex-snapshot
Constructions and properties of block codes for partial-response channels
inferred← citeshttps://doi.org/10.1109/18.661533openalex-snapshot
Efficient encoding algorithm for third-order spectral-null codes
inferred← citeshttps://doi.org/10.1109/18.720539openalex-snapshot
Codes for digital recorders
inferred← citeshttps://doi.org/10.1109/18.782100openalex-snapshot
Asymptotically exact bounds on the size of high-order spectral-null codes
inferred← citeshttps://doi.org/10.1109/18.796412openalex-snapshot
On efficient high-order spectral-null codes
inferred← citeshttps://doi.org/10.1109/18.959281openalex-snapshot
Algorithms to enumerate codewords for DC/sup 2/-constrained channels
inferred← citeshttps://doi.org/10.1109/access.2019.2934847openalex-snapshot
On Redundancy Reduction of Non-Recursive Second-Order Spectral-Null Codes
inferred← citeshttps://doi.org/10.1109/ccece.1999.807163openalex-snapshot
Extended properties of high-order spectral-null words
inferred← citeshttps://doi.org/10.1109/isit.1994.394884openalex-snapshot
Balanced codes with parallel encoding/decoding
inferred← citeshttps://doi.org/10.1109/isit.1995.531348openalex-snapshot
On efficient high-order spectral-null codes
inferred← citeshttps://doi.org/10.1109/isit.1998.708700openalex-snapshot
On efficient m-ary q-th order spectral-null codes
inferred← citeshttps://doi.org/10.1109/isit.2000.866679openalex-snapshot
Efficient coding for high-order spectral-null sequences
inferred← citeshttps://doi.org/10.1109/isit.2001.936115openalex-snapshot
A new metric for comparing performance of high-order spectral-null codes
inferred← citeshttps://doi.org/10.1109/isit.2003.1228147openalex-snapshot
On balanced codes over the m-th roots of unity, m=4
inferred← citeshttps://doi.org/10.1109/isit.2004.1365127openalex-snapshot
An algorithm to enumerate codewords for third-order spectral-null codes
inferred← citeshttps://doi.org/10.1109/isit.2013.6620204openalex-snapshot
On efficient second-order spectral-null codes using sets of m1-balancing functions
inferred← citeshttps://doi.org/10.1109/isit.2016.7541288openalex-snapshot
Minimum pearson distance detection in the presence of unknown slowly varying offset
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517873openalex-snapshot
Balanced de Bruijn Sequences
inferred← citeshttps://doi.org/10.1109/itw.2008.4578700openalex-snapshot
k-bit grouping moment balancing templates for spectral shaping codes
inferred← citeshttps://doi.org/10.1109/jsac.2016.2603618openalex-snapshot
Minimum Pearson Distance Detection Using Mass-Centered Codewords in the Presence of Unknown Varying Offset
inferred← citeshttps://doi.org/10.1109/jsait.2023.3338326openalex-snapshot
Dimensions of Channel Coding: From Theory to Algorithms to Applications
inferred← citeshttps://doi.org/10.1109/lcomm.2018.2877324openalex-snapshot
Estimated Spectra of Higher Order Spectral Null Codes
inferred← citeshttps://doi.org/10.1109/mbits.2023.3336213openalex-snapshot
Channels Engineering in Magnetic Recording: From Theory to Practice
inferred← citeshttps://doi.org/10.1109/prdc.2000.897291openalex-snapshot
Some improved encoding and decoding schemes for balanced codes
inferred← citeshttps://doi.org/10.1109/tc.2003.1228518openalex-snapshot
Efficient encoding and decoding schemes for balanced codes
inferred← citeshttps://doi.org/10.1109/tc.2006.111openalex-snapshot
Some new efficient second-order spectral-null codes with small lookup tables
inferred← citeshttps://doi.org/10.1109/tc.2007.70849openalex-snapshot
Efficient Encoding Algorithm for Second-Order Spectral-Null Codes Using Cyclic Bit Shift
inferred← citeshttps://doi.org/10.1109/tc.2010.242openalex-snapshot
Efficient Encoding/Decoding for Second-Order Spectral-Null Codes by Reducing Random Walks
inferred← citeshttps://doi.org/10.1109/tc.2013.231openalex-snapshot
Reducing Code Length of Second-Order Spectral-Null Code
inferred← citeshttps://doi.org/10.1109/tcomm.2004.833044openalex-snapshot
High-Order Spectral-Null Multimode Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2019.2911583openalex-snapshot
Computation of the Spectrum of dc2-Balanced Codes
inferred← citeshttps://doi.org/10.1109/tit.2003.822610openalex-snapshot
A Performance Metric for Codes With a High-Order Spectral Null at Zero Frequency
inferred← citeshttps://doi.org/10.1109/tit.2005.844085openalex-snapshot
Design of Efficient Second-Order Spectral-Null Codes
inferred← citeshttps://doi.org/10.1109/tit.2006.872981openalex-snapshot
On efficient balanced codes over the mth roots of unity
inferred← citeshttps://doi.org/10.1109/tit.2016.2555322openalex-snapshot
Efficient Non-Recursive Design of Second-Order Spectral-Null Codes
inferred← citeshttps://doi.org/10.1109/tit.2022.3227467openalex-snapshot
On Hierarchies of Balanced Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1004.1503openalex-snapshot
A New Construction for Constant Weight Codes
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.