BibTeX records: Cornelis de Vroedt

download as .bib file

@article{DBLP:journals/tc/WeberVB92,
  author       = {Jacobus H. Weber and
                  Cornelis de Vroedt and
                  Dick E. Boekee},
  title        = {Necessary and Sufficient Conditions on Block Codes Correcting/Detecting
                  Errors of Various Types},
  journal      = {{IEEE} Trans. Computers},
  volume       = {41},
  number       = {9},
  pages        = {1189--1193},
  year         = {1992},
  url          = {https://doi.org/10.1109/12.165401},
  doi          = {10.1109/12.165401},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tc/WeberVB92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcc/SimonisV91,
  author       = {Juriaan Simonis and
                  Cornelis de Vroedt},
  title        = {A Simple Proof of the Delsarte Inequalities},
  journal      = {Des. Codes Cryptogr.},
  volume       = {1},
  number       = {1},
  pages        = {77--82},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF00123961},
  doi          = {10.1007/BF00123961},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/SimonisV91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Vroedt91,
  author       = {Cornelis de Vroedt},
  title        = {On the maximum cardinality of binary constant weight codes with prescribed
                  distance},
  journal      = {Discret. Math.},
  volume       = {97},
  number       = {1-3},
  pages        = {155--160},
  year         = {1991},
  url          = {https://doi.org/10.1016/0012-365X(91)90430-A},
  doi          = {10.1016/0012-365X(91)90430-A},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Vroedt91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Vroedt91a,
  author       = {Cornelis de Vroedt},
  title        = {{\"{U}}ber einen Satz von K{\"{o}}hler},
  journal      = {Discret. Math.},
  volume       = {97},
  number       = {1-3},
  pages        = {161--165},
  year         = {1991},
  url          = {https://doi.org/10.1016/0012-365X(91)90431-Z},
  doi          = {10.1016/0012-365X(91)90431-Z},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Vroedt91a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/WeberVB89,
  author       = {Jacobus H. Weber and
                  Cornelis de Vroedt and
                  Dick E. Boekee},
  title        = {Bounds and constructions for codes correcting unidirectional errors},
  journal      = {{IEEE} Trans. Inf. Theory},
  volume       = {35},
  number       = {4},
  pages        = {797--810},
  year         = {1989},
  url          = {https://doi.org/10.1109/18.32156},
  doi          = {10.1109/18.32156},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tit/WeberVB89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/RavesteijnV88,
  author       = {R. L. A. van Ravesteijn and
                  Cornelis de Vroedt},
  title        = {A direct proof of the weight retaining property of polynomials over
                  a finite field},
  journal      = {{IEEE} Trans. Inf. Theory},
  volume       = {34},
  number       = {4},
  pages        = {875--877},
  year         = {1988},
  url          = {https://doi.org/10.1109/18.9788},
  doi          = {10.1109/18.9788},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tit/RavesteijnV88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/WeberVB88,
  author       = {Jacobus H. Weber and
                  Cornelis de Vroedt and
                  Dick E. Boekee},
  title        = {Bounds and constructions for binary codes of length less than 24 and
                  asymmetric distance less than 6},
  journal      = {{IEEE} Trans. Inf. Theory},
  volume       = {34},
  number       = {5},
  pages        = {1321--1331},
  year         = {1988},
  url          = {https://doi.org/10.1109/18.21262},
  doi          = {10.1109/18.21262},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tit/WeberVB88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/WeberVB87,
  author       = {Jacobus H. Weber and
                  Cornelis de Vroedt and
                  Dick E. Boekee},
  title        = {New upper bounds on the size of codes correcting asymmetric errors},
  journal      = {{IEEE} Trans. Inf. Theory},
  volume       = {33},
  number       = {3},
  pages        = {434--437},
  year         = {1987},
  url          = {https://doi.org/10.1109/TIT.1987.1057301},
  doi          = {10.1109/TIT.1987.1057301},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tit/WeberVB87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/RemijnV84,
  author       = {J. C. C. M. Remijn and
                  Cornelis de Vroedt},
  title        = {The minimum distance of the [38, 19] ternary extended QR-code is 11},
  journal      = {{IEEE} Trans. Inf. Theory},
  volume       = {30},
  number       = {2},
  pages        = {405--407},
  year         = {1984},
  url          = {https://doi.org/10.1109/TIT.1984.1056860},
  doi          = {10.1109/TIT.1984.1056860},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tit/RemijnV84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RoosV82,
  author       = {Cees Roos and
                  Cornelis de Vroedt},
  title        = {Upper bounds for A(n, 4) and A(n, 6) derived from Delsarte's linear
                  programming bound},
  journal      = {Discret. Math.},
  volume       = {40},
  number       = {2-3},
  pages        = {261--276},
  year         = {1982},
  url          = {https://doi.org/10.1016/0012-365X(82)90126-1},
  doi          = {10.1016/0012-365X(82)90126-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/RoosV82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics