Tuvi Etzion

J. Graph Theory, January, 2024

On de Bruijn Arrays Codes, Part I: Nonlinear Codes.

[BibT_eX]

[DOI]

CoRR, 2024

Repairing Reed-Solomon Codes with Side Information.

[BibT_eX]

[DOI]

CoRR, 2024

Nearly Perfect Covering Codes.

[BibT_eX]

[DOI]

Avital Boruchovsky

CoRR, 2024

Maximum Length RLL Sequences in de Bruijn Graph.

[BibT_eX]

[DOI]

CoRR, 2024

Permutations that Separate Close Elements, and Rectangle Packings in the Torus.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

The Capacity of the Weighted Read Channel.

[BibT_eX]

[DOI]

Omer Yerushalmi

Proceedings of the IEEE International Symposium on Information Theory, 2024

Repairing a Single Erasure in Reed-Solomon Codes with Side Information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Pseduo- Random and de Bruijn Array Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Thermal-Aware Channel with Multiple Wires.

[BibT_eX]

[DOI]

Yeow Meng Chee

Kees A. Schouhamer Immink

Proceedings of the IEEE International Symposium on Information Theory, 2024

On de Bruijn Covering Sequences and Arrays.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Repairing with Zero Skip Cost.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Pair-Covering Codes.

[BibT_eX]

[DOI]

Avital Boruchovsky

Proceedings of the IEEE International Symposium on Information Theory, 2024

Representing Information on DNA Using Patterns Induced by Enzymatic Labeling.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

On Hierarchies of Balanced Sequences.

[BibT_eX]

[DOI]

Sagi Marcovich

IEEE Trans. Inf. Theory, May, 2023

On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric.

[BibT_eX]

[DOI]

Daniella Bar-Lev

IEEE Trans. Inf. Theory, April, 2023

Dimensions of Channel Coding: From Theory to Algorithms to Applications.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

Domination mappings into the hamming ball: Existence, constructions, and algorithms.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2023

Thermal-Aware Channel Capacity.

[BibT_eX]

[DOI]

Yeow Meng Chee

Kees A. Schouhamer Immink

Proceedings of the IEEE International Symposium on Information Theory, 2023

Coding for IBLTs with Listing Guarantees.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Non-Binary Diameter Perfect Constant-Weight Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Covering Sequences for ℓ-Tuples.

[BibT_eX]

[DOI]

Sagi Marcovich

Proceedings of the IEEE International Symposium on Information Theory, 2022

Perfect Codes and Related Structures

[BibT_eX]

[DOI]

WorldScientific, ISBN: 9789811255892, 2022

2021

Private Proximity Retrieval Codes.

[BibT_eX]

[DOI]

Yiwei Zhang

IEEE Trans. Inf. Theory, 2021

Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Editorial JCTA.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2021

Large sets with multiplicity.

[BibT_eX]

[DOI]

Junling Zhou

Des. Codes Cryptogr., 2021

Deep DNA Storage: Scalable and Robust DNA Storage via Coding Theory and Deep Learning.

[BibT_eX]

[DOI]

CoRR, 2021

On the Size of Levenshtein Balls.

[BibT_eX]

[DOI]

Daniella Bar-Lev

CoRR, 2021

Balanced de Bruijn Sequences.

[BibT_eX]

[DOI]

Sagi Marcovich

Proceedings of the IEEE International Symposium on Information Theory, 2021

Regular Multiset Combinatorial Batch Codes over Vector Spaces.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

On Levenshtein Balls with Radius One.

[BibT_eX]

[DOI]

Daniella Bar-Lev

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Bounds on the Length of Functional PIR and Batch Codes.

[BibT_eX]

[DOI]

Yiwei Zhang

IEEE Trans. Inf. Theory, 2020

Low-Power Cooling Codes With Efficient Encoding and Decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Network-Coding Solutions for Minimal Combination Networks and Their Sub-Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

PIR Schemes With Small Download Complexity and Low Storage Requirements.

[BibT_eX]

[DOI]

Maura B. Paterson

IEEE Trans. Inf. Theory, 2020

Subspace packings: constructions and bounds.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2020

Constrained de Bruijn Codes: Properties, Enumeration, Constructions, and Applications.

[BibT_eX]

[DOI]

CoRR, 2020

Recovery Sets for Subspaces from a Vector Space.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Efficient Algorithm for the Linear Complexity of Sequences and Some Related Consequences.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Locality and Availability of Array Codes Constructed From Subspaces.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Local Rank Modulation for Flash Memories.

[BibT_eX]

[DOI]

Michal Horovitz

IEEE Trans. Inf. Theory, 2019

Grassmannian Codes With New Distance Measures for Network Coding.

[BibT_eX]

[DOI]

Hui Zhang

IEEE Trans. Inf. Theory, 2019

PIR Array Codes With Optimal Virtual Server Rate.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

On the Access Complexity of PIR Schemes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Private Proximity Retrieval.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Constrained de Bruijn Codes and their Applications.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Network Coding Solutions for the Combination Network and its Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding.

[BibT_eX]

[DOI]

Antonia Wachter-Zeh

IEEE Trans. Inf. Theory, 2018

Metrics Based on Finite Directed Graphs and Coding Invariants.

[BibT_eX]

[DOI]

Marcelo Firer

Roberto Assis Machado

IEEE Trans. Inf. Theory, 2018

Cooling Codes: Thermal-Management Coding for High-Performance Interconnects.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Subspace Packings.

[BibT_eX]

[DOI]

CoRR, 2018

Residual q-Fano Planes and Related Structures.

[BibT_eX]

[DOI]

Niv Hooker

Electron. J. Comb., 2018

A New Approach for Examining q-Steiner Systems.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

2017

Constructions of High-Rate Minimum Storage Regenerating Codes Over Small Fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Regular graphs with forbidden subgraphs of Kn with k edges.

[BibT_eX]

[DOI]

Int. J. Inf. Coding Theory, 2017

PIR array codes with optimal PIR rates.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Optimal Ferrers Diagram Rank-Metric Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Systematic Error-Correcting Codes for Permutations and Multi-Permutations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Subspace Polynomials and Cyclic Subspace Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Galois geometries and coding theory.

[BibT_eX]

[DOI]

Leo Storme

Des. Codes Cryptogr., 2016

PIR Array Codes with Optimal PIR Rate.

[BibT_eX]

[DOI]

CoRR, 2016

Metrics based on finite directed graphs.

[BibT_eX]

[DOI]

Marcelo Firer

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Optimal Fractional Repetition Codes Based on Graphs and Designs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Binary Polarization Kernels From Code Decompositions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Bounds on the Size of Permutation Codes With the Kendall τ-Metric.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Equidistant codes in the Grassmannian.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Access-optimal MSR Codes with Optimal Sub-packetization over Small Fields.

[BibT_eX]

[DOI]

CoRR, 2015

Optimal fractional repetition codes and fractional repetition batch codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Distributed storage systems based on intersecting subspace codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Constructions of Snake-in-the-Box Codes for Rank Modulation.

[BibT_eX]

[DOI]

Michal Horovitz

IEEE Trans. Inf. Theory, 2014

The q-analog of the middle levels problem.

[BibT_eX]

[DOI]

Discret. Math., 2014

Covering of subspaces by subspaces.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

Optimal Ferrers Diagram Rank-Metric Codes.

[BibT_eX]

[DOI]

Antonia Wachter-Zeh

CoRR, 2014

Optimal Fractional Repetition Codes.

[BibT_eX]

[DOI]

CoRR, 2014

Distributed Storage Systems based on Equidistant Subspace Codes.

[BibT_eX]

[DOI]

CoRR, 2014

Local Rank Modulation for Flash Memories II.

[BibT_eX]

[DOI]

Michal Horovitz

CoRR, 2014

Optimal Permutation Codes and the Kendall's $τ$-Metric.

[BibT_eX]

[DOI]

CoRR, 2014

A new construction for constant weight codes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and its Applications, 2014

Systematic codes for rank modulation.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Perfect permutation codes with the Kendall's τ-metric.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Coding for the Lee and Manhattan Metrics With Weighing Matrices.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Errata to "Codes and Designs Related to Lifted MRD Codes".

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Codes and Designs Related to Lifted MRD Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Tilings With $n$ -Dimensional Chairs and Their Applications to Asymmetric Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Tilings by (0.5, n)-Crosses and Perfect Codes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Problems on q-Analogs in Coding Theory

[BibT_eX]

[DOI]

CoRR, 2013

Perfect Permutations Codes with the Kendall's $τ$-Metric.

[BibT_eX]

[DOI]

CoRR, 2013

Error-correcting codes for multipermutations.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Simple and Robust Binary Self-Location Patterns.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

The Asymptotic Behavior of Grassmannian Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Tilings with $n$-Dimensional Chairs and their Applications to WOM Codes

[BibT_eX]

[DOI]

CoRR, 2012

2011

Enumerative Coding for Grassmannian Space.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Error-Correcting Codes in Projective Space.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Product Constructions for Perfect Lee Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Sequence Folding, Lattice Tiling, and Multidimensional Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

On the Existence of Perfect Codes for Asymmetric Limited-Magnitude Errors

[BibT_eX]

[DOI]

CoRR, 2011

Perfect Codes for Uniform Chains Poset Metrics

[BibT_eX]

[DOI]

CoRR, 2011

Linearity and Complements in Projective Space

[BibT_eX]

[DOI]

Michael Braun

CoRR, 2011

Large constant dimension codes and lexicodes.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2011

On q-analogs of Steiner systems and covering designs.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2011

Some new distance-4 constant weight codes.

[BibT_eX]

[DOI]

Andries E. Brouwer

Adv. Math. Commun., 2011

Sidon sequences and doubly periodic two-dimensional synchronization patterns.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Distinct difference configurations: multihop paths and key predistribution in sensor networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Two-dimensional patterns with distinct differences: constructions, bounds, and maximal anticodes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Traceability codes.

[BibT_eX]

[DOI]

Siaw-Lynn Ng

J. Comb. Theory A, 2010

On Perfect Codes in the Johnson Graph

[BibT_eX]

[DOI]

CoRR, 2010

Dense error-correcting codes in the Lee metric.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

High dimensional error-correcting codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

On row-by-row coding for 2-D constraints.

[BibT_eX]

[DOI]

Ido Tal

Ron M. Roth

IEEE Trans. Inf. Theory, 2009

Error-Correction of Multidimensional Bursts.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Properties of the error linear complexity spectrum.

[BibT_eX]

[DOI]

Nicholas Kalouptsidis

Nicholas Kolokotronis

Konstantinos Limniotis

IEEE Trans. Inf. Theory, 2009

Key Predistribution Techniques for Grid-Based Wireless Sensor Networks.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Representation of Subspaces and Enumerative Encoding of the Grassmannian Space

[BibT_eX]

[DOI]

CoRR, 2009

Folding, Tiling, and Multidimensional Coding

[BibT_eX]

[DOI]

CoRR, 2009

Enumerative Encoding in the Grassmannian Space

[BibT_eX]

[DOI]

CoRR, 2009

Problems on Two-Dimensional Synchronization Patterns.

[BibT_eX]

[DOI]

Proceedings of the Coding and Cryptology, Second International Workshop, 2009

2008

Prolific Codes with the Identifiable Parent Property.

[BibT_eX]

[DOI]

Siaw-Lynn Ng

SIAM J. Discret. Math., 2008

A bound on the size of separating hash families.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2008

Construction of Error-Correcting Codes for Random Network Coding

[BibT_eX]

[DOI]

CoRR, 2008

Coding Theory in Projective Space

[BibT_eX]

[DOI]

CoRR, 2008

On the error linear complexity profiles of binary sequences of period 2n.

[BibT_eX]

[DOI]

Nicholas Kalouptsidis

Nicholas Kolokotronis

Konstantinos Limniotis

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Efficient Key Predistribution for Grid-Based Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security, Third International Conference, 2008

2007

New upper bounds on codes via association schemes and linear programming.

[BibT_eX]

[DOI]

Simon Litsyn

Adv. Math. Commun., 2007

Single-Track Gray Codes and Sequences.

[BibT_eX]

[DOI]

Proceedings of the Sequences, Subsequences, and Consequences, International Workshop, 2007

2006

On the Stopping Redundancy of Reed-Muller Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels.

[BibT_eX]

[DOI]

Keren Censor

IEEE Trans. Inf. Theory, 2006

Optimal tristance anticodes in certain graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

Perfect Codes in the Johnson Schemes.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

2005

Two-dimensional cluster-correcting codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Zero/Positive Capacities of Two-Dimensional Runlength-Constrained Arrays.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Quasi-perfect codes with small distance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

On the Optimality of Coloring with a Lattice.

[BibT_eX]

[DOI]

Yael Ben-Haim

SIAM J. Discret. Math., 2005

New upper bounds on A(n, d).

[BibT_eX]

[DOI]

Simon Litsyn

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

Perfect Constant-Weight Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

On the optimality of coloring with a lattice.

[BibT_eX]

[DOI]

Yael Merksamer

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Quasiperfect codes with small distance.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Two-dimensional burst-correcting codes.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

Optimal 2-Dimensional 3-Dispersion Lattices.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2003

2002

Improved upper bounds on sizes of codes.

[BibT_eX]

[DOI]

Simon Litsyn

IEEE Trans. Inf. Theory, 2002

Two-dimensional interleaving schemes with repetitions: Constructions and bounds.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Codes and Anticodes in the Grassman Graph.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2002

2001

Constructions for perfect 2-burst-correcting codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

2000

Optimal codes for single-error correction, double-adjacent-error detection.

[BibT_eX]

[DOI]

Marina Biberstein

IEEE Trans. Inf. Theory, 2000

1999

Efficient Code Construction for Certain Two-Dimensional Constraints.

[BibT_eX]

[DOI]

Roman Talyansky

Ron M. Roth

IEEE Trans. Inf. Theory, 1999

The structure of single-track Gray codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Which codes have cycle-free Tanner graphs?

[BibT_eX]

[DOI]

Ari Trachtenberg

IEEE Trans. Inf. Theory, 1999

Linear Complexity of de Brujin Sequences - Old and New Results.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

On perfect constant weight codes.

[BibT_eX]

[DOI]

Jack H. van Lint

Proceedings of the Codes and Association Schemes, 1999

On perfect codes in the Johnson scheme.

[BibT_eX]

[DOI]

Proceedings of the Codes and Association Schemes, 1999

1998

Efficient Encoding Algorithm for Third-Order Spectral-Null Codes.

[BibT_eX]

[DOI]

Vitaly Skachek

Ron M. Roth

IEEE Trans. Inf. Theory, 1998

Greedy and Heuristic Algorithms for Codes and Colorings.

[BibT_eX]

[DOI]

Patric R. J. Östergård

IEEE Trans. Inf. Theory, 1998

Perfect Byte-Correcting Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

On Perfect Codes and Tilings: Problems and Solutions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1998

1997

The depth distribution-a new characterization for linear codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Cascading methods for runlength-limited arrays.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Intersection of Isomorphic Linear Codes.

[BibT_eX]

[DOI]

Eli Bar-Yahalom

J. Comb. Theory A, 1997

Optimal constant weight codes over Zk and generalized designs.

[BibT_eX]

[DOI]

Discret. Math., 1997

1996

A method for constructing decodable de Bruijn sequences.

[BibT_eX]

[DOI]

Chris J. Mitchell

IEEE Trans. Inf. Theory, 1996

Near optimal single-track Gray codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

On the Nonexistence of Perfect Codes in the Johnson Scheme.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1996

Nonequivalent q-ary Perfect Codes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1996

Permutation Polynomials, de Bruijn Sequences, and Linear Complexity.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1996

On the Chromatic Number, Colorings, and Codes of the Johnson Graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

1995

Constructions for optimal constant weight cyclically permutable codes and difference families.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Bounds on the Sizes of Constant Weight Covering Codes.

[BibT_eX]

[DOI]

Victor K. Wei

Zhen Zhang

Des. Codes Cryptogr., 1995

1994

Perfect binary codes: constructions, properties, and enumeration.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

1993

Normal and abnormal codes.

[BibT_eX]

[DOI]

Gadi Greenberg

Iiro S. Honkala

IEEE Trans. Inf. Theory, 1993

Constructions for perfect mixed codes and other covering codes.

[BibT_eX]

[DOI]

Gadi Greenberg

IEEE Trans. Inf. Theory, 1993

Rotating-Table Games and Derivatives of Words.

[BibT_eX]

[DOI]

Reuven Bar-Yehuda

Shlomo Moran

Theor. Comput. Sci., 1993

The Last Packing Number of Quadruples, and Cyclic SQS.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1993

On Constructions for Optimal Optical Orthogonal Codes.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Coding, 1993

Some Constructions of Perfect Binary Codes.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1993

1992

Optimal codes for correcting single errors and detecting adjacent errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

Correction to 'New lower bounds for asymmetric and unidirectional codes' (Nov 91 1696-1704).

[BibT_eX]

IEEE Trans. Inf. Theory, 1992

UPP Graphs and UMFA Networks-Architecture for Parallel Systems.

[BibT_eX]

[DOI]

David Goldfeld

IEEE Trans. Computers, 1992

An explicit construction of Euler circuits in shuffle nets and related networks.

[BibT_eX]

[DOI]

Israel Bar-David

Networks, 1992

Partitions of Triples into Optimal Packings.

[BibT_eX]

J. Comb. Theory A, 1992

Optimal Partitions for Triples.

[BibT_eX]

J. Comb. Theory A, 1992

Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks.

[BibT_eX]

[DOI]

Reuven Bar-Yehuda

Discret. Appl. Math., 1992

1991

New lower bounds for asymmetric and unidirectional codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

Towards a Large Set of Steiner Quadruple Systems.

[BibT_eX]

[DOI]

Alan Hartman

SIAM J. Discret. Math., 1991

Combinatorial designs with Costas arrays properties.

[BibT_eX]

[DOI]

Discret. Math., 1991

1990

Constructions of error-correcting DC-free block codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1990

Hamiltonian decomposition of K*n, patterns with distinct differences, and Tuscan squares.

[BibT_eX]

[DOI]

Discret. Math., 1990

1989

New lower bounds for constant weight codes.

[BibT_eX]

[DOI]

Cornelis L. M. van Pul

IEEE Trans. Inf. Theory, 1989

1988

Constructions for perfect maps and pseudorandom arrays.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

1987

Self-dual sequences.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1987

1986

On the distribution of de Bruijn CR-sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1986

An Algorithm for Generating Shift-Register Cycles.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

An Algorithm for Constructing m-ary de Bruijn Sequences.

[BibT_eX]

[DOI]

J. Algorithms, 1986

1985

On the Distribution of de Bruijn Sequences of Low Complexity.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1985

1984

Construction of de Bruijn sequences of minimal complexity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1984

On the distribution of de Bruijn sequences of given complexity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1984

Algorithms for the generation of full-length shift-register sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1984

1983

Super-Nets and their Hierarchy.

[BibT_eX]

[DOI]

Michael Yoeli

Theor. Comput. Sci., 1983

1982

Behavioral Equivalence of Concurrent Systems.

[BibT_eX]

[DOI]

Michael Yoeli