On the public citation graph

Perfect Codes in the Lee Metric and the Packing of Polyominoes

0 signed · 221 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.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1090/s0002-9904-1965-11345-3openalex-snapshot
Research problems
inferredcites →https://doi.org/10.1109/tit.1964.1053680openalex-snapshot
Rook domains, Latin squares, affine planes, and error-distributing codes

What points at this work

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

inferred← citeshttps://doi.org/10.5281/zenodo.23398805zenodo-depositor-declared
inferred← citeshttps://doi.org/10.5281/zenodo.23540940zenodo-depositor-declared
inferred← citeshttps://doi.org/10.1006/eujc.1998.0211openalex-snapshot
On the Non-existence of 3-Dimensional Tiling in the Lee Metric
inferred← citeshttps://doi.org/10.1007/3-540-19368-5_5openalex-snapshot
The les association scheme
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_8openalex-snapshot
On the Use of Duality and Geometry in Layouts for ATM Networks
inferred← citeshttps://doi.org/10.1007/3-540-46521-9_4openalex-snapshot
Duality in ATM Layout Problems
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_77openalex-snapshot
The file distribution problem for processor networks
inferred← citeshttps://doi.org/10.1007/978-1-4615-0304-0_19openalex-snapshot
Tilings with Generalized Lee Spheres
inferred← citeshttps://doi.org/10.1007/978-3-031-06833-1_3openalex-snapshot
Topological Quantum Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-53139-7_6openalex-snapshot
Orthogonal Polynomials in Information Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-67882-5_3openalex-snapshot
Lattices from Codes
inferred← citeshttps://doi.org/10.1007/978-3-540-85093-9_6openalex-snapshot
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/bfb0024497openalex-snapshot
On optimal graphs embedded into paths and rings, with analysis using l 1-spheres
inferred← citeshttps://doi.org/10.1007/s00200-023-00608-4openalex-snapshot
MWS and FWS codes for coordinate-wise weight functions
inferred← citeshttps://doi.org/10.1007/s00224-023-10139-7openalex-snapshot
Expansivity and Periodicity in Algebraic Subshifts
inferred← citeshttps://doi.org/10.1007/s00454-011-9373-5openalex-snapshot
Non-periodic Tilings of ℝ n by Crosses
inferred← citeshttps://doi.org/10.1007/s00454-012-9438-0openalex-snapshot
The Structure of Cube Tilings Under Symmetry Conditions
inferred← citeshttps://doi.org/10.1007/s10623-009-9277-zopenalex-snapshot
Weighted codes in Lee metrics
inferred← citeshttps://doi.org/10.1007/s10623-012-9666-6openalex-snapshot
A generalization of Lee codes
inferred← citeshttps://doi.org/10.1007/s10623-019-00624-xopenalex-snapshot
Steganographic schemes from perfect codes on Cayley graphs
inferred← citeshttps://doi.org/10.1007/s10623-023-01240-6openalex-snapshot
Characterizing subgroup perfect codes by 2-subgroups
inferred← citeshttps://doi.org/10.1007/s10623-024-01410-0openalex-snapshot
On the packing density of Lee spheres
inferred← citeshttps://doi.org/10.1007/s10801-023-01241-7openalex-snapshot
On abelian cayley graphs of diameter two and defect one
inferred← citeshttps://doi.org/10.1007/s10801-024-01298-yopenalex-snapshot
On regular sets in Cayley graphs
inferred← citeshttps://doi.org/10.1007/s11045-010-0134-zopenalex-snapshot
Basis arrays and successive packing for M-D interleaving
inferred← citeshttps://doi.org/10.1007/s11128-023-03931-4openalex-snapshot
On the construction of new toric quantum codes and quantum burst-error-correcting codes
inferred← citeshttps://doi.org/10.1007/s11128-023-04213-9openalex-snapshot
New three- and four-dimensional toric and burst error-correcting quantum codes
inferred← citeshttps://doi.org/10.1007/s40314-016-0372-2openalex-snapshot
Quasi-perfect codes in the $$\ell _p$$ ℓ p metric
inferred← citeshttps://doi.org/10.1007/s40314-021-01436-3openalex-snapshot
Perfect codes in Euclidean lattices
inferred← citeshttps://doi.org/10.1007/s40840-025-01866-wopenalex-snapshot
Subgroup Perfect Codes of 2-Groups with Cyclic Maximal Subgroups
inferred← citeshttps://doi.org/10.1016/0097-3165(76)90076-5openalex-snapshot
Derived things
inferred← citeshttps://doi.org/10.1016/b978-0-12-813388-0.00003-3openalex-snapshot
Distances
inferred← citeshttps://doi.org/10.1016/j.dam.2006.11.009openalex-snapshot
Optimal interleaving schemes for correcting two-dimensional cluster errors
inferred← citeshttps://doi.org/10.1016/j.dam.2011.07.022openalex-snapshot
The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes
inferred← citeshttps://doi.org/10.1016/j.dam.2012.03.032openalex-snapshot
(a,b) -codes in Z/nZ
inferred← citeshttps://doi.org/10.1016/j.dam.2013.06.012openalex-snapshot
[1, 2]-sets in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2026.08.042openalex-snapshot
Classification of perfect and total perfect codes in generalized Petersen graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.09.036openalex-snapshot
A generalization of the pentomino exclusion problem: Dislocation of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.10.020openalex-snapshot
Codes over Hurwitz integers
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113716openalex-snapshot
Perfect codes in two-dimensional algebraic lattices
inferred← citeshttps://doi.org/10.1016/j.ejc.2005.08.003openalex-snapshot
Nonexistence of face-to-face four-dimensional tilings in the Lee metric
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.11.007openalex-snapshot
On perfect codes in Cartesian products of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.05.031openalex-snapshot
On the non-existence of lattice tilings by quasi-crosses
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.10.010openalex-snapshot
A new approach towards the Golomb–Welch conjecture
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.11.002openalex-snapshot
Perfect codes in the lp metric
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.01.007openalex-snapshot
Nonexistence of perfect 2 -error-correcting Lee codes in certain dimensions
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.103022openalex-snapshot
On the non-existence of linear perfect Lee codes: The Zhang–Ge condition and a new polynomial criterion
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.041openalex-snapshot
Perfect codes in Cartesian products of hypercube and multidimensional grid
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.079openalex-snapshot
Weighted perfect codes in Lee metric
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.12.010openalex-snapshot
Characterizing r-perfect codes in direct products of two and three cycles
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.03.010openalex-snapshot
Perfect codes in direct graph bundles
inferred← citeshttps://doi.org/10.1016/j.jcta.2007.12.009openalex-snapshot
Adaptive identification in graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2019.02.008openalex-snapshot
On the nonexistence of lattice tilings of Z n by Lee spheres
inferred← citeshttps://doi.org/10.1016/j.jcta.2019.105157openalex-snapshot
No lattice tiling of Z n by Lee sphere of radius 2
inferred← citeshttps://doi.org/10.1016/j.jcta.2023.105816openalex-snapshot
On linear diameter perfect Lee codes with distance 6
inferred← citeshttps://doi.org/10.1016/j.jnt.2014.07.021openalex-snapshot
Mellin transforms with only critical zeros: Legendre functions
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.03.013openalex-snapshot
Quotients of Gaussian graphs and their application to perfect codes
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00268-5openalex-snapshot
On the nonexistence of three-dimensional tiling in the Lee metric II
inferred← citeshttps://doi.org/10.1016/s0020-0190(03)00268-0openalex-snapshot
Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00091-7openalex-snapshot
On domination numbers of Cartesian product of paths
inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70419-7openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70549-xopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0924-6509(13)70005-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0924-6509(97)80023-2openalex-snapshot
Complexity
inferred← citeshttps://doi.org/10.1023/a:1005106901394openalex-snapshot
Variations on Tilings in the Manhattan Metric
inferred← citeshttps://doi.org/10.1080/02522667.1992.10699099openalex-snapshot
Variable Length Perfect Codes
inferred← citeshttps://doi.org/10.1090/conm/291/04893openalex-snapshot
Multiple polylogarithms: a brief survey
inferred← citeshttps://doi.org/10.1109/18.335966openalex-snapshot
Lee-metric BCH codes and their application to constrained and partial-response channels
inferred← citeshttps://doi.org/10.1109/18.661516openalex-snapshot
Interleaving schemes for multidimensional cluster errors
inferred← citeshttps://doi.org/10.1109/18.992804openalex-snapshot
Decoding a class of Lee metric codes over a Galois ring
inferred← citeshttps://doi.org/10.1109/81.974881openalex-snapshot
Perfect r-domination in the Kronecker product of three cycles
inferred← citeshttps://doi.org/10.1109/cig.2010.5592743openalex-snapshot
Dense error-correcting codes in the Lee metric
inferred← citeshttps://doi.org/10.1109/ciss.2006.286522openalex-snapshot
Frequency Coded Waveforms for Adaptive Waveform Radar
inferred← citeshttps://doi.org/10.1109/globecom48099.2022.10000761openalex-snapshot
New Quantum Burst-Error Correcting Codes from Interleaving Technique
inferred← citeshttps://doi.org/10.1109/isccsp.2012.6217864openalex-snapshot
On the use of Lee-codes for constructing multiple-valued error-correcting decision diagrams
inferred← citeshttps://doi.org/10.1109/isit.1998.708850openalex-snapshot
Splittings of cyclic groups, tilings of Euclidean space, and perfect shift codes
inferred← citeshttps://doi.org/10.1109/isit.2004.1365058openalex-snapshot
On the optimality of coloring with a lattice
inferred← citeshttps://doi.org/10.1109/isit.2004.1365059openalex-snapshot
Optimal interleaving schemes for correcting 2-D cluster errors
inferred← citeshttps://doi.org/10.1109/isit.2004.1365060openalex-snapshot
Optimal t-interleaving on tori
inferred← citeshttps://doi.org/10.1109/isit.2006.261892openalex-snapshot
A Generalization of Perfect Lee Codes over Gaussian Integers
inferred← citeshttps://doi.org/10.1109/isit.2007.4557415openalex-snapshot
Error-Correction of Multidimensional Bursts
inferred← citeshttps://doi.org/10.1109/isit.2008.4595284openalex-snapshot
Rank modulation for flash memories
inferred← citeshttps://doi.org/10.1109/isit.2008.4595285openalex-snapshot
Error-correcting codes for rank modulation
inferred← citeshttps://doi.org/10.1109/isit.2008.4595440openalex-snapshot
Graph-based metrics over QAM constellations
inferred← citeshttps://doi.org/10.1109/isit.2010.5513662openalex-snapshot
High dimensional error-correcting codes
inferred← citeshttps://doi.org/10.1109/isit.2010.5513673openalex-snapshot
Quasi-perfect geometrically uniform codes derived from graphs over Gaussian integer rings
inferred← citeshttps://doi.org/10.1109/isit.2010.5513724openalex-snapshot
Perfect graph codes over two dimensional lattices
inferred← citeshttps://doi.org/10.1109/isit.2011.6033934openalex-snapshot
Quasi-Cross Lattice Tilings With Applications to Flash Memory
inferred← citeshttps://doi.org/10.1109/isit.2012.6284106openalex-snapshot
Systematic error-correcting codes for rank modulation
inferred← citeshttps://doi.org/10.1109/isit.2013.6620275openalex-snapshot
Coding for the Lee and Manhattan metrics with weighing matrices
inferred← citeshttps://doi.org/10.1109/isit.2013.6620313openalex-snapshot
Lattice based codes for insertion and deletion channels
inferred← citeshttps://doi.org/10.1109/isit.2014.6875261openalex-snapshot
Systematic codes for rank modulation
inferred← citeshttps://doi.org/10.1109/isit.2014.6875262openalex-snapshot
Perfect permutation codes with the Kendall's τ-metric
inferred← citeshttps://doi.org/10.1109/isit.2018.8437919openalex-snapshot
Fault- Tolerant Dot-Product Engines
inferred← citeshttps://doi.org/10.1109/isit.2019.8849247openalex-snapshot
Bounds on Codes for the Bit-Shift Channel with (d,k)-Constrained Inputs
inferred← citeshttps://doi.org/10.1109/isit.2019.8849251openalex-snapshot
Metrics which turn tilings into binary perfect codes
inferred← citeshttps://doi.org/10.1109/isit.2019.8849538openalex-snapshot
Perfect Codes in Euclidean Lattices: Bounds and Case Studies
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653815openalex-snapshot
2-quasi-perfect Lee codes and abelian Ramanujan graphs: a new construction and relationship
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653936openalex-snapshot
Codes Correcting Few Restricted Errors
inferred← citeshttps://doi.org/10.1109/ispa.2013.6703787openalex-snapshot
Bounds on the size of Lee-codes
inferred← citeshttps://doi.org/10.1109/isssta.2004.1371736openalex-snapshot
User traffic multiplexing on OFDM downlink
inferred← citeshttps://doi.org/10.1109/ita.2013.6502976openalex-snapshot
On the non-existence of lattice tilings by quasi-crosses
inferred← citeshttps://doi.org/10.1109/ita.2014.6804217openalex-snapshot
Codes and lattices in the lp metric
inferred← citeshttps://doi.org/10.1109/ita.2016.7888160openalex-snapshot
On perfect q-ary codes in the maximum metric
inferred← citeshttps://doi.org/10.1109/itre.2003.1270576openalex-snapshot
Optimal 2-D interleaving for robust multimedia transmission
inferred← citeshttps://doi.org/10.1109/itw.2009.5351419openalex-snapshot
Bounding the minimal Euclidean distance for any PSK block codes of alphabet size 8
inferred← citeshttps://doi.org/10.1109/itw.2011.6089382openalex-snapshot
Decoding q-ary lattices in the Lee metric
inferred← citeshttps://doi.org/10.1109/itw.2015.7133084openalex-snapshot
Cross-packing lattices for the Rician fading channel
inferred← citeshttps://doi.org/10.1109/mcas.2004.1286985openalex-snapshot
Interleaving for combating bursts of errors
inferred← citeshttps://doi.org/10.1109/nrc.2002.999714openalex-snapshot
Frequency coded waveforms for enhanced delay-Doppler resolution
inferred← citeshttps://doi.org/10.1109/proc.1984.12994openalex-snapshot
Constructions and properties of Costas arrays
inferred← citeshttps://doi.org/10.1109/tcsi.2002.1010033openalex-snapshot
A new two-dimensional interleaving technique using successive packing
inferred← citeshttps://doi.org/10.1109/tit.2003.818408openalex-snapshot
Frequency-coded waveforms for enhanced delay-doppler resolution
inferred← citeshttps://doi.org/10.1109/tit.2004.842739openalex-snapshot
Optimal 2-D Interleaving With Latin Rectangles
inferred← citeshttps://doi.org/10.1109/tit.2004.842779openalex-snapshot
On the Covering Radii of Binary Reed–Muller Codes in the Set of Resilient Boolean Functions
inferred← citeshttps://doi.org/10.1109/tit.2006.880071openalex-snapshot
Optimal Interleaving Schemes for Two-Dimensional Arrays
inferred← citeshttps://doi.org/10.1109/tit.2007.903126openalex-snapshot
Perfect Codes for Metrics Induced by Circulant Graphs
inferred← citeshttps://doi.org/10.1109/tit.2008.2011520openalex-snapshot
Error-Correction of Multidimensional Bursts
inferred← citeshttps://doi.org/10.1109/tit.2008.928286openalex-snapshot
Two-Dimensional Array Coloring With Many Colors
inferred← citeshttps://doi.org/10.1109/tit.2009.2023733openalex-snapshot
Perfect Codes From Cayley Graphs Over Lipschitz Integers
inferred← citeshttps://doi.org/10.1109/tit.2009.2039046openalex-snapshot
Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes
inferred← citeshttps://doi.org/10.1109/tit.2010.2043764openalex-snapshot
Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
inferred← citeshttps://doi.org/10.1109/tit.2010.2048455openalex-snapshot
Codes in Permutations and Error Correction for Rank Modulation
inferred← citeshttps://doi.org/10.1109/tit.2011.2161133openalex-snapshot
Product Constructions for Perfect Lee Codes
inferred← citeshttps://doi.org/10.1109/tit.2012.2196257openalex-snapshot
Diameter Perfect Lee Codes
inferred← citeshttps://doi.org/10.1109/tit.2013.2266398openalex-snapshot
Quasi-Perfect Codes From Cayley Graphs Over Integer Rings
inferred← citeshttps://doi.org/10.1109/tit.2013.2268156openalex-snapshot
Coding for the Lee and Manhattan Metrics With Weighing Matrices
inferred← citeshttps://doi.org/10.1109/tit.2013.2290045openalex-snapshot
Codes for Information Retrieval With Small Uncertainty
inferred← citeshttps://doi.org/10.1109/tit.2014.2365499openalex-snapshot
Systematic Error-Correcting Codes for Rank Modulation
inferred← citeshttps://doi.org/10.1109/tit.2015.2424701openalex-snapshot
Bounds on the Size of Permutation Codes With the Kendall $\tau $ -Metric
inferred← citeshttps://doi.org/10.1109/tit.2015.2448674openalex-snapshot
1-Perfect Codes Over Dual-Cubes vis-à-vis Hamming Codes Over Hypercubes
inferred← citeshttps://doi.org/10.1109/tit.2016.2517069openalex-snapshot
Quasi-Perfect Lee Codes of Radius 2 and Arbitrarily Large Dimension
inferred← citeshttps://doi.org/10.1109/tit.2016.2543739openalex-snapshot
Systematic Error-Correcting Codes for Permutations and Multi-Permutations
inferred← citeshttps://doi.org/10.1109/tit.2016.2595778openalex-snapshot
The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs
inferred← citeshttps://doi.org/10.1109/tit.2017.2685424openalex-snapshot
Perfect and Quasi-Perfect Codes Under the $l_{p}$ Metric
inferred← citeshttps://doi.org/10.1109/tit.2017.2786675openalex-snapshot
50 Years of the Golomb–Welch Conjecture
inferred← citeshttps://doi.org/10.1109/tit.2017.2789292openalex-snapshot
Codes in the Space of Multisets—Coding for Permutation Channels With Impairments
inferred← citeshttps://doi.org/10.1109/tit.2018.2789921openalex-snapshot
2-Correcting Lee Codes: (Quasi)-Perfect Spectral Conditions and Some Constructions
inferred← citeshttps://doi.org/10.1109/tit.2018.2791990openalex-snapshot
Lattice Codes for Deletion and Repetition Channels
inferred← citeshttps://doi.org/10.1109/tit.2018.2797049openalex-snapshot
Non-Existence of Linear Perfect Lee Codes With Radius 2 for Infinitely Many Dimensions
inferred← citeshttps://doi.org/10.1109/tit.2019.2907979openalex-snapshot
Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis
inferred← citeshttps://doi.org/10.1109/tit.2020.2988865openalex-snapshot
Obtaining Binary Perfect Codes Out of Tilings
inferred← citeshttps://doi.org/10.1109/tit.2022.3172924openalex-snapshot
1-Perfect Codes Over the Quad-Cube
inferred← citeshttps://doi.org/10.1109/tit.2023.3287222openalex-snapshot
On Almost Perfect Linear Lee Codes of Packing Radius 2
inferred← citeshttps://doi.org/10.1109/tit.2023.3341954openalex-snapshot
Almost Perfect Linear Lee Codes of Packing Radius 2 Only Exist for Small Dimensions
inferred← citeshttps://doi.org/10.1112/blms.12699openalex-snapshot
Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets
inferred← citeshttps://doi.org/10.1134/s0032946008010018openalex-snapshot
Modeling hexagonal constellations with Eisenstein-Jacobi graphs
inferred← citeshttps://doi.org/10.1134/s003294602203005xopenalex-snapshot
Partitions into Perfect Codes in the Hamming and Lee Metrics
inferred← citeshttps://doi.org/10.1134/s0032946023020011openalex-snapshot
Constructions and Invariants of Optimal Codes in the Lee Metric
inferred← citeshttps://doi.org/10.1137/040618655openalex-snapshot
Optimal Interleaving on Tori
inferred← citeshttps://doi.org/10.1137/040621387openalex-snapshot
Optimal Lee-Type Local Structures in Cartesian Products of Cycles and Paths
inferred← citeshttps://doi.org/10.1137/1017046openalex-snapshot
Optimization and the Geometry of Numbers: Packing and Covering
inferred← citeshttps://doi.org/10.1137/110839916openalex-snapshot
Tilings by $(0.5,n)$-Crosses and Perfect Codes
inferred← citeshttps://doi.org/10.1137/16m1099182openalex-snapshot
Improved Bounds on Sidon Sets via Lattice Packings of Simplices
inferred← citeshttps://doi.org/10.1137/s0895480104439589openalex-snapshot
On the Optimality of Coloring with a Lattice
inferred← citeshttps://doi.org/10.1137/s0895480194275692openalex-snapshot
On the Nonexistence of Perfect Codes in the Johnson Scheme
inferred← citeshttps://doi.org/10.1142/s0219498825410245openalex-snapshot
Eigenvalue bounds for the distance-t chromatic number of a graph and their application to Lee codes
inferred← citeshttps://doi.org/10.1142/s1793830921501019openalex-snapshot
Perfect t-codes in Cayley graphs of groups
inferred← citeshttps://doi.org/10.1142/s1793830924500241openalex-snapshot
Characterization of some specific lee distance codes over finite rings
inferred← citeshttps://doi.org/10.1145/2653481.2653489openalex-snapshot
Efficient coverage for grid-based mobile wireless sensor networks
inferred← citeshttps://doi.org/10.1145/2882966openalex-snapshot
Accurate, Dynamic, and Distributed Localization of Phenomena for Mobile Sensor Networks
inferred← citeshttps://doi.org/10.1145/3343485.3343502openalex-snapshot
Packing of R3 by Crosses
inferred← citeshttps://doi.org/10.11540/bjsiam.26.3_29openalex-snapshot
ポストモダン符号理論としてのネットワーク,置換,形式化3:置換符号
inferred← citeshttps://doi.org/10.1216/rmj-1975-5-2-199openalex-snapshot
A survey of perfect codes
inferred← citeshttps://doi.org/10.12732/ijam.v34i3.5openalex-snapshot
ON THE CONSTRUCTION OF PERFECT CODES FOR $n$-DIMENSIONAL INTERLEAVING
inferred← citeshttps://doi.org/10.14209/sbrt.2009.54744openalex-snapshot
Construção de Novos Códigos Quânticos Tóricos
inferred← citeshttps://doi.org/10.1515/advgeom-2024-0006openalex-snapshot
Lower bound on the translative covering density of octahedra
inferred← citeshttps://doi.org/10.1515/math-2018-0027openalex-snapshot
Restriction conditions on PL(7, 2) codes (3 ≤ |𝓖 i | ≤ 7)
inferred← citeshttps://doi.org/10.17223/20710410/25/7openalex-snapshot
On the problem of circulant networks with the maximal number of nodes for any diamete
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
inferred← citeshttps://doi.org/10.2139/ssrn.7404672openalex-snapshot
coldcore: a GPU framework for exhaustive-coverage combinatorial optimization
inferred← citeshttps://doi.org/10.2298/fil2530847bopenalex-snapshot
A family of optimal linear codes of length $2^s$ over the ring $\frac{\mathbb{F}_2[u]}{⟨u^2⟩}$ with Lee distance 4
inferred← citeshttps://doi.org/10.31857/s0555292323020018openalex-snapshot
Constructions and invariants of optimal codes in the Lee metric
inferred← citeshttps://doi.org/10.3390/axioms13100676openalex-snapshot
Algebraic and Geometric Methods for Construction of Topological Quantum Codes from Lattices
inferred← citeshttps://doi.org/10.3390/sym16121614openalex-snapshot
Codes with Weighted Poset Metrics Based on the Lattice of Subgroups of Zm
inferred← citeshttps://doi.org/10.36227/techrxiv.21173695openalex-snapshot
Error-Correcting Codes in the Two-Dimensional Lee Metric on Square and Hexagonal Signal Constellations
inferred← citeshttps://doi.org/10.36227/techrxiv.21173695.v1openalex-snapshot
Error-Correcting Codes in the Two-Dimensional Lee Metric on Square and Hexagonal Signal Constellations
inferred← citeshttps://doi.org/10.37236/1009openalex-snapshot
Perfect Dominating Sets in the Cartesian Products of Prime Cycles
inferred← citeshttps://doi.org/10.37236/10515openalex-snapshot
High-Dimensional Holeyominoes
inferred← citeshttps://doi.org/10.37236/1962openalex-snapshot
Perfect Codes in Cartesian Products of 2-Paths and Infinite Paths
inferred← citeshttps://doi.org/10.37236/4279openalex-snapshot
The Degree-Diameter Problem for Circulant Graphs of Degree 8 and 9
inferred← citeshttps://doi.org/10.37236/927openalex-snapshot
Nonabelian Groups with $(96,20,4)$ Difference Sets
inferred← citeshttps://doi.org/10.3934/math.2026605openalex-snapshot
Block $ LS $–poset codes over $ {\mathbb{Z}}_m^n $: Perfect codes, Singleton bound, and MDS characterization
inferred← citeshttps://doi.org/10.46298/dmtcs.574openalex-snapshot
Adaptive Identification of Sets of Vertices in Graphs
inferred← citeshttps://doi.org/10.47749/t/unicamp.2011.791524openalex-snapshot
Códigos geometricamente uniformes derivados de grafos sobre anéis quocientes de inteiros e de ordens dos quatérnios
inferred← citeshttps://doi.org/10.47749/t/unicamp.2014.928535openalex-snapshot
Reticulados, projeções e aplicações à teoria da informação
inferred← citeshttps://doi.org/10.47749/t/unicamp.2015.959438openalex-snapshot
Códigos perfeitos nas métricas de Lee e Chebyshev e iterações de funções de Rédei
inferred← citeshttps://doi.org/10.47749/t/unicamp.2017.989546openalex-snapshot
Simetrias e grafos
inferred← citeshttps://doi.org/10.48550/arxiv.0910.5697openalex-snapshot
High Dimensional Error-Correcting Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1004.0366openalex-snapshot
Dense Error-Correcting Codes in the Lee Metric
inferred← citeshttps://doi.org/10.48550/arxiv.1105.5557openalex-snapshot
Decoding q-ary lattices in the Lee metric
inferred← citeshttps://doi.org/10.48550/arxiv.1107.5706openalex-snapshot
Tilings by $(0.5,n)$-Crosses and Perfect Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1201.3315openalex-snapshot
Perfect Mannheim, Lipschitz and Hurwitz weight codes
inferred← citeshttps://doi.org/10.48550/arxiv.1210.5725openalex-snapshot
Coding for the Lee and Manhattan Metrics with Weighing Matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1210.5863openalex-snapshot
A Generalization of Lee Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1306.5350openalex-snapshot
Error Correction for NOR Memory Devices with Exponentially Distributed Read Noise
inferred← citeshttps://doi.org/10.48550/arxiv.1308.6821openalex-snapshot
Mellin transforms with only critical zeros: generalized Hermite functions
inferred← citeshttps://doi.org/10.48550/arxiv.1310.6817openalex-snapshot
Systematic Error-Correcting Codes for Rank Modulation
inferred← citeshttps://doi.org/10.48550/arxiv.1311.7113openalex-snapshot
Systematic Codes for Rank Modulation
inferred← citeshttps://doi.org/10.48550/arxiv.1405.7464openalex-snapshot
Cross-Error Correcting Integer Codes over $\mathbb{Z}_{2^m}$
showing the first 200 of 218 · page through all 218
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.