we use to select compact group candidates from the redshift surveys is a modification of the friends-of-friends algorithm developed by Huchra & Geller (1982). We use a new group-finding code from Ramella, Pisani & Geller (1996). We identify groups of galaxies as linked sets of “neighboring” galaxies. To determine whether two galaxies belong to a group, we consider both their projected separation, $\Delta D$, and their line-of-sight velocity difference, $\Delta V$. The projected separation of the pair is $\Delta D=2\left(\frac{v}{H_{0}}\right)\sin\left(\frac{\Delta \theta}{2}
\right)$, where $\Delta \theta$ is the angular separation on the sky and $v=cz$ is the average redshift. Throughout the paper we use $H_{0} = 100\ {\rm km \  s}^{-1}{\rm Mpc}^{-1}$.

We restrict the size of our groups by specifying limiting parameters, $D_{0}$ and $V_{0}$. If $\Delta D \leq D_{0}$ and $\Delta V \leq V_{0}$, the galaxies are neighbors. We search each galaxy in a pair of neighbors for additional neighbors. Linked sets of neighbors are groups. Groups with three or more members constitute our objective sample of compact groups. We select values of $V_{0}$ and $D_{0}$ which produce a catalog of systems with properties similar to those of Hickson Compact Groups. We keep $D_{0}$ fixed to ensure that we 