On the public citation graph
Permutation codes for the Gaussian channel
0 signed · 47 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/j.1538-7305.1963.tb04013.xopenalex-snapshot
Bounds on Communication
inferredcites →https://doi.org/10.1002/j.1538-7305.1968.tb02486.xopenalex-snapshot
Group Codes for the Gaussian Channel
inferredcites →https://doi.org/10.1007/978-1-4757-2016-7openalex-snapshot
Sphere Packings, Lattices and Groups
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50020-5openalex-snapshot
Computational methods in the study of permutation groups††This research was supported in part by the National Science Foundation.
inferredcites →https://doi.org/10.1017/cbo9780511600739openalex-snapshot
Permutation Groups and Combinatorial Structures
inferredcites →https://doi.org/10.1090/s0002-9947-1972-0285629-3openalex-snapshot
An Optimization Problem for Unitary and Orthogonal Representations of Finite Groups
inferredcites →https://doi.org/10.1109/proc.1976.10265openalex-snapshot
The mathematical theory of coding
inferredcites →https://doi.org/10.1109/tit.1968.1054110openalex-snapshot
Group codes for the Gaussian channel (Abstr.)
inferredcites →https://doi.org/10.1109/tit.1976.1055629openalex-snapshot
Optimum permutation modulation codes and their asymptotic performance (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1982.1056454openalex-snapshot
Channel coding with multilevel/phase signals
inferredcites →https://doi.org/10.1137/0123033openalex-snapshot
Distance Properties of Group Codes for the Gaussian Channel
inferredcites →https://doi.org/10.1137/0305018openalex-snapshot
On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
inferredcites →https://doi.org/10.1145/800206.806362openalex-snapshot
The basis of a computer system for modern algebra
inferredcites →https://doi.org/10.4135/9781412959384.n229openalex-snapshot
Mathematical Theory of Communication
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-57189-3_13openalex-snapshot
Decoding Spherical Codes Generated by Binary Partitions of Symmetric Pointsets
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90004-3openalex-snapshot
Large scale geometric programming: An application in coding theory
inferred← citeshttps://doi.org/10.1080/00207169708804590openalex-snapshot
A minimax method with application to the initial vector coding problem*
inferred← citeshttps://doi.org/10.1109/18.179342openalex-snapshot
Decoding spherical codes for the Gaussian channel
inferred← citeshttps://doi.org/10.1109/18.370114openalex-snapshot
Spherical codes generated by binary partitions of symmetric pointsets
inferred← citeshttps://doi.org/10.1109/18.567763openalex-snapshot
Optimal permutation codes for the Gaussian channel
inferred← citeshttps://doi.org/10.1109/18.782174openalex-snapshot
Representing group codes as permutation codes
inferred← citeshttps://doi.org/10.1109/ictel.2003.1191603openalex-snapshot
Permutation modulation for fading channels
inferred← citeshttps://doi.org/10.1109/isit.2007.4557566openalex-snapshot
Arbitrary Rate Permutation Modulation for the Gaussian Channel
inferred← citeshttps://doi.org/10.1109/isit.2011.6033769openalex-snapshot
LP decodable permutation codes based on linearly constrained permutation matrices
inferred← citeshttps://doi.org/10.1109/isit.2012.6284108openalex-snapshot
Rank modulation for translocation error correction
inferred← citeshttps://doi.org/10.1109/isit.2015.7282751openalex-snapshot
New bounds for permutation codes in Ulam metric
inferred← citeshttps://doi.org/10.1109/istc.2018.8625268openalex-snapshot
A Message-passing Algorithm Realizing MAP Decoding of Kløve’s Permutation Codes
inferred← citeshttps://doi.org/10.1109/memstech.2017.7937549openalex-snapshot
Entropy estimation of investigated object state
inferred← citeshttps://doi.org/10.1109/tit.2012.2196253openalex-snapshot
LP-Decodable Permutation Codes Based on Linearly Constrained Permutation Matrices
inferred← citeshttps://doi.org/10.1109/tit.2013.2239700openalex-snapshot
Error-Correction in Flash Memories via Codes in the Ulam Metric
inferred← citeshttps://doi.org/10.1109/tit.2018.2868453openalex-snapshot
Line Codes Generated by Finite Coxeter Groups
inferred← citeshttps://doi.org/10.1109/vetec.1992.245244openalex-snapshot
A robust source/channel coding and modulation technique for bandwidth efficient transmission
inferred← citeshttps://doi.org/10.1109/vetec.1993.507518openalex-snapshot
Combined source coding and modulation for fading channels
inferred← citeshttps://doi.org/10.12794/metadc68065openalex-snapshot
Physical-Layer Network Coding for MIMO Systems
inferred← citeshttps://doi.org/10.14209/sbrt.2004.142openalex-snapshot
Códigos de Permutação Vetorial para Modulação
inferred← citeshttps://doi.org/10.1561/9781933019574openalex-snapshot
Geometric Programming for Communication Systems
inferred← citeshttps://doi.org/10.47839/ijc.15.1.828openalex-snapshot
INFORMATION STATE OF SYSTEM ESTIMATION
inferred← citeshttps://doi.org/10.48550/arxiv.1011.6441openalex-snapshot
LP Decodable Permutation Codes based on Linearly Constrained Permutation Matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1202.0932openalex-snapshot
Error-Correction in Flash Memories via Codes in the Ulam Metric
inferred← citeshttps://doi.org/10.48550/arxiv.1504.05100openalex-snapshot
New Bounds for Permutation Codes in Ulam Metric
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.