Lee Distance and Topological Properties of k-ary n-cubes

No abstract is available for this paper.

• Publication year

  1995

• Venue

  IEEE Trans. Computers

• Publication date

  1995-08-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/12.403718
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Resource Placement with Multiple Adjacency Constraints in k-ary n-Cubes

  1995cited by this paper
• A Family of Bch Codes for the Lee Metric

  1993cited by this paper
• A survey of wormhole routing techniques in direct networks

  1993cited by this paper
• Resource Placement in k-Ary n-Cubes

  1992cited by this paper
• The message-driven processor: a multicomputer processing node with efficient mechanisms

  1992cited by this paper
• Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes

  1991cited by this paper
• Fault-Tolerant Resource Placement in Hypercube Computers

  1991cited by this paper
• Resource Allocation in Hypercube Systems

  1990cited by this paper
• Submicron Systems Architecture Project: Semiannual Technical Report

  1989cited by this paper
• The J-Machine: A Fine Grain Concurrent Computer

  1989cited by this paper
• Distributing resources in hypercube computers

  1988cited by this paper
• iWarp: an integrated solution to high-speed parallel computing

  1988cited by this paper
• The architecture and programming of the Ametek series 2010 multicomputer

  1988cited by this paper
• Algebraic coding theory

  1984cited by this paper
• Generalized Hypercube and Hyperbus Structures for a Computer Network

  1984cited by this paper

• Non-inclusive <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e1057" altimg="si8.svg"> <mml:mi>g</mml:mi> </mml:math> -extra diagnosability of interconnection networks under MM* model

  2026cites this paper
• 2-Edge Hamiltonian connectedness: Characterization and results in data center networks

  2025cites this paper
• Tiling of toroidal arrays with pictures: Uniqueness, shift-equivalence and undecidability

  2025cites this paper
• Memory as Resonance: A Biomimetic Architecture for Infinite Context Memory on Ergodic Phonetic Manifolds

  2025cites this paper
• The g-good-neighbor diagnosability of product networks under the PMC model

  2025cites this paper
• Node-disjoint paths in k-ary n-cube with optimal maximum path length

  2025cites this paper
• Node-edge hybrid diagnosability and conditional node-edge hybrid diagnosability under the HPMC* model

  2025cites this paper
• Efficient fault tolerance and diagnosis mechanism for Network-on-Chips

  2025cites this paper
• The Hamiltonian Property of the Data Center Network DPCell

  2025cites this paper
• On the fault diameter and wide diameter of the exchanged 3-ary n-cube

  2025cites this paper
• Fault diagnosability of (K4 – e)-free multiprocessor systems under the PMC and HPMC model

  2024cites this paper
• On the Spanning Cyclability of k-ary n-cube Networks

  2024cites this paper
• Reliability assessment for k-ary n-cubes with faulty edges

  2024cites this paper
• Reliability of m-ary n-dimensional hypercubes under embedded restriction

  2024cites this paper
• The t/k-diagnosability of m-ary n-cube networks

  2024cites this paper
• Embedding Hamiltonian Paths with Prescribed Linear Forests into k-ary n-Cube Networks

  2024cites this paper
• Shortest node-to-node disjoint paths algorithm for symmetric networks

  2024cites this paper
• The intermittent diagnosability for two families of interconnection networks under the PMC model and MM* model

  2023cites this paper
• The diagnosability of 3-ary n-cubes under the symmetric PMC model

  2023cites this paper
• Construction algorithms of fault-tolerant paths and disjoint paths in k-ary n-cube networks

  2023cites this paper
• Distance magic labeling of the halved folded n-cube

  2023cites this paper
• On Optimal Embeddings in 3-Ary n-Cubes

  2023cites this paper
• On k-ary n-cubes and isometric words

  2022cites this paper
• Decompositions of Circulant-Balanced Complete Multipartite Graphs Based on a Novel Labelling Approach

  2022cites this paper
• Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees

  2022cites this paper
• Robustness of Subsystem Reliability of <inline-formula><tex-math notation="LaTeX">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href="zhou-ieq1-3199251.gif"/></alternatives></inline-formula>-Ary <inline-formula><tex-math notation="LaTeX">$n$</tex-math><alte

  2022cites this paper
• QoS-Aware Resource Placement for LEO Satellite Edge Computing

  2022cites this paper
• Embedded edge connectivity of k-ary n-cubes

  2022cites this paper
• An <inline-formula><tex-math notation="LaTeX">$O(\log _3N)$</tex-math></inline-formula> Algorithm for Reliability Assessment of 3-Ary <inline-formula><tex-math notation="LaTeX">$n$</tex-math></inline-formula>-Cubes Based on <inline-formula><tex-math notation="LaTeX">$h$</tex-math></inline-formula>-E

  2022influential citation
• Combinatorial Gray codes-an updated survey

  2022cites this paper
• Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube

  2021cites this paper
• Independent spanning trees in Eisenstein–Jacobi networks

  2021cites this paper
• Quaternary n-cubes and Isometric Words

  2021cites this paper
• Embedded connectivity of ternary n-cubes

  2021cites this paper
• The Reliability of k-Ary n-Cube Based on Component Connectivity

  2021cites this paper
• Real-Time Fault-Tolerance Node-to-Node Disjoint Paths Algorithm for Symmetric Networks

  2021cites this paper
• Adaptive Diagnosis of Hamiltonian Networks under the Comparison Model

  2021cites this paper
• An Exchanged 3-Ary n-Cube Interconnection Network for Parallel Computation

  2021cites this paper
• Hamiltonian paths of k-ary n-cubes avoiding faulty links and passing through prescribed linear forests

  2021cites this paper
• Binary codes from m-ary n-cubes Qmn

  2021cites this paper
• Codes from incidence matrices of some Bouwer graphs

  2020cites this paper
• The reliability analysis of k-ary n-cube networks

  2020cites this paper
• Neural Networks for Authenticating Integrated Circuits Based on Intrinsic Nonlinearity

  2020cites this paper
• Codes from incidence matrices of some regular graphs

  2020cites this paper
• Job Scheduling Performance for Multiple Partner Non-Contiguous Allocation with k-Ary n-Cube connected Multi-Computers

  2020cites this paper
• Path and cycle fault tolerance of bubble-sort graph networks

  2019cites this paper
• Structure fault tolerance of k-ary n-cube networks

  2019cites this paper
• The diagnosability of k-ary n-cubes with missing edges

  2019cites this paper
• Edge-bipancyclicity in conditional edge-faulty k-ary n-cubes

  2019cites this paper
• Neural Network Decoder of Automatic Process Control System

  2019cites this paper
• Embedding fault-free hamiltonian paths with prescribed linear forests into faulty ternary n-cubes

  2019cites this paper
• The h-extra connectivity of k-ary n-cubes

  2019cites this paper
• 2-Correcting Lee Codes: (Quasi)-Perfect Spectral Conditions and Some Constructions

  2018cites this paper
• Structure connectivity and substructure connectivity of k-ary n-cube networks

  2018cites this paper
• The Edge Connectivity of Expanded k-Ary n-Cubes

  2018cites this paper
• A type of perfect matchings extend to hamiltonian cycles in k-ary n-cubes

  2018cites this paper
• Conditional diagnosability of the round matching composition networks

  2017cites this paper
• Node-independent spanning trees in Gaussian networks

  2017cites this paper
• On the extraconnectivity of k-ary n-cube networks

  2017influential citation
• Paired many-to-many disjoint path covers of hypertori

  2017cites this paper
• Embedding various cycles with prescribed paths into k-ary n-cubes

  2017cites this paper
• The connectivity and nature diagnosability of expanded k-ary n-cubes

  2017cites this paper
• Balanced Gray Codes With Flexible Lengths

  2016cites this paper
• g-Good-neighbor conditional diagnosability measures for 3-ary n-cube networks

  2016influential citation
• Quasi-Perfect Lee Codes from Quadratic Curves over Finite Fields

  2016cites this paper
• Hamiltonian Cycle and Path Embeddings in 3-Ary n-Cubes Based on K1,2-Structure Faults

  2016cites this paper
• Edge-disjoint node-independent spanning trees in dense Gaussian networks

  2016cites this paper
• Hamiltonian Cycle and Path Embeddings in k-Ary n-Cubes Based on Structure Faults

  2016cites this paper
• An Improved One-to-All Broadcasting in Higher Dimensional Eisenstein-Jacobi Networks

  2016cites this paper
• Unchanging the diameter of k-ary n-cube networks with faulty vertices

  2015influential citation
• Constructing all shortest node-disjoint paths in torus networks

  2015cites this paper
• The ${\schmi g}$-Good-Neighbor Conditional Diagnosability of ${\schmi k}$-Ary ${\schmi n}$-Cubes under the PMC Modeland MM* Model

  2015cites this paper
• Fault-Free Hamiltonian Cycles Passing through Prescribed Edges in k-Ary n-Cubes with Faulty Edges

  2015cites this paper
• Interconnection Networks Based on Gaussian and Eisenstein-Jacobi Integers

  2015cites this paper
• Locality-aware policies to improve job scheduling on 3D tori

  2015cites this paper
• Matchings extend to Hamiltonian cycles in k-ary n-cubes

  2015cites this paper
• Parallel Hermite Interpolation on Faulty Kary n-cubes Network

  2015cites this paper
• Panconnectivity and pancyclicity of the 3-ary n-cube network under the path restrictions

  2014cites this paper
• Interconnection Networks of Degree Three Obtained by Pruning Two-Dimensional Tori

  2014cites this paper
• Higher Dimensional Gaussian Networks

  2014cites this paper
• Optimal wavelength assignment in the implementation of parallel algorithms with ternary n-cube communication pattern on mesh optical network

  2014cites this paper
• An approach to conditional diagnosability analysis under the PMC model and its application to torus networks

  2014cites this paper
• Relating Diagnosability, Strong Diagnosability and Conditional Diagnosability of Strong Networks

  2014cites this paper
• ILargest Connected Component of a k-ary n-cube with Faulty Vertices

  2013cites this paper
• Contributions at the Interface Between Algebra and Graph Theory

  2013cites this paper
• A Study on Graph Theoretical Algorithms in Grid Environment

  2013cites this paper
• 3-extra Connectivity of 3-ary N-cube Networks

  2013cites this paper
• Many-to-many disjoint path covers in kk-ary nn-cubes

  2013cites this paper
• On 3-extra connectivity of k-ary n-cubes

  2013influential citation
• Strong matching preclusion for k-ary n-cubes

  2013cites this paper
• Fault-free Hamiltonian cycles passing through a linear forest in ternary nn-cubes with faulty edges

  2013cites this paper
• The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model

  2013cites this paper
• The diagnosability of the k-ary n-cubes using the pessimistic strategy

  2012cites this paper
• Extraconnectivity of k-ary n-cube networks

  2012cites this paper
• Pancyclicity of k-ary n-cube networks with faulty vertices and edges

  2012cites this paper
• Conditional Diagnosability of k-Ary n-Cubes under the PMC Model

  2012influential citation
• Efficient Communication Algorithms in Hexagonal Mesh Interconnection Networks

  2012cites this paper
• Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even

  2011cites this paper
• On shortest disjoint paths and Hamiltonian cycles in some interconnection networks

  2011cites this paper
• One-to-one disjoint path covers on k-ary n-cubes

  2011cites this paper